skip to main content
10.1145/1454008.1454026acmconferencesArticle/Chapter ViewAbstractPublication PagesrecsysConference Proceedingsconference-collections
research-article

Incremental probabilistic latent semantic analysis for automatic question recommendation

Published:23 October 2008Publication History

ABSTRACT

With the fast development of web 2.0, user-centric publishing and knowledge management platforms, such as Wiki, Blogs, and Q & A systems attract a large number of users. Given the availability of the huge amount of meaningful user generated content, incremental model based recommendation techniques can be employed to improve users' experience using automatic recommendations. In this paper, we propose an incremental recommendation algorithm based on Probabilistic Latent Semantic Analysis (PLSA). The proposed algorithm can consider not only the users' long-term and short-term interests, but also users' negative and positive feedback. We compare the proposed method with several baseline methods using a real-world Question & Answer website called Wenda. Experiments demonstrate both the effectiveness and the efficiency of the proposed methods.

References

  1. Thomas Hofmann. Unsupervised Learning by Probabilistic Latent Semantic Analysis. Maching Learning Journal, Vol. 42, No. 1-2, pp. 177--196, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. M. Girolami and A. Kaban. On an Equivalence Between PLSI and LDA. In: Proceedings of SIGIR, pp. 433--434, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Dempster A. P., Laird N. M., and Rubin D. B. Maximum Likelihood from Incomplete Data via the EM Algorithm. Journal of the Royal Statistical Society, Series B, Vol. 39, No. 1, pp. 1--38, 1977.Google ScholarGoogle Scholar
  4. Christophe G. Carrier. A Note on the Utility of Incremental Learning. AI Communications, Vol. 13, No. 4, pp. 215--223, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. T. C. Chou and M.C Chen. Using Incremental PLSA for Threshold Resilient Online Event Anlysis. IEEE Transaction on Knowledge and Data Engineering, Vol. 20, No. 3, pp. 289--299, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. T. Hofmann. Latent Semantic Models for Collaborative Filtering. ACM Transaction Information System, Vol. 22, No. 1, pp.89--115, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. L. Zhang and C. Li, etc. An Efficient Solution to Factor Drifting Problem in the PLSA Model. In: Proceedings of the The Fifth International Conference on Computer and Information Technology, pp.175--181, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. J. Zhang, Z. Ghahramani, and Y. Yang. A Probabilistic Model for Online Document Clustering with Applications to Novelty Detection. In Proceedings of NIPS, pp. 1617--1624, 2005.Google ScholarGoogle Scholar
  9. Arun C. Surendran and Suvrit Sra. Incremental Aspect Models for Mining Document Streams. 10th European Conferences on Principles and Practice of Knowledge Discovery, pp. 633--640, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. J. T. Chien and M. S. Wu. Adaptive Bayesian Latent Semantic Analysis. IEEE Transactions on Audio, Speech, and Language Processing, Vol. 16, No. 1, pp. 198--207, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. B. Marlin. Collaborative Filtering: A Machine Learning Perspective. Master's thesis, University of Toronto, 2004.Google ScholarGoogle Scholar
  12. Das A., Datar M., Garg A. and Rajaram S. Google News Personalization: Scalable Online Collaborative Filtering. In: Proc. of the 16th Int. Conf. on World Wide Web, pp. 270--280, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. D. M. Blei, A. Ng, and M. I. Jordan. Latent Dirichlet Allocation. Journal of Machine Learning Research, 3, 993--1022, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. R. M. Neal and G. E. Hinton. A View of the EM Algorithm that Justifies Incremental, Sparse, and other Variants. In Learning in Graphical Models. Kluwer Academic Press, pp. 355--368, 1998. Google ScholarGoogle ScholarCross RefCross Ref
  15. Arindam Banerjee and Sugato Basu. Topic Models over Text Streams: A Study of Batch and Online Unsupervised Learning. In: Proceedings of the SIAM International Conference on Data Mining (SDM), pp.437--442, 2007.Google ScholarGoogle ScholarCross RefCross Ref
  16. Asela Gunawardana, William Byrne. Convergence Theorems for Generalized Alternating Minimization Procedures. The Journal of Machine Learning Research, Vol. 6, pp. 2049--2073, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Y. B. Cao, H. Z. Duan, C. Y. Lin, Y. Yu, and H. W. Hon. Recommending Questions Using the MDL-based Tree Cut Model. In: Proc. of the 17th Int. Conf. on World Wide Web, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Lada, A. Adamic, J. Zhang, and etc. Knowledge Sharing and Yahoo Answers: Everyone Knows Something. In: Proc. of the 17th Int. Conf. on World Wide Web, pp. 665--674, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Z. Gyöngyi, G. Koutrika, etc. Questioning Yahoo! Answers. First WWW Workshop on Question Answering on the Web, 2008.Google ScholarGoogle Scholar

Index Terms

  1. Incremental probabilistic latent semantic analysis for automatic question recommendation

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      RecSys '08: Proceedings of the 2008 ACM conference on Recommender systems
      October 2008
      348 pages
      ISBN:9781605580937
      DOI:10.1145/1454008

      Copyright © 2008 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 23 October 2008

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article

      Acceptance Rates

      Overall Acceptance Rate254of1,295submissions,20%

      Upcoming Conference

      RecSys '24
      18th ACM Conference on Recommender Systems
      October 14 - 18, 2024
      Bari , Italy

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader