Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2014, Article ID 979147, 10 pages
http://dx.doi.org/10.1155/2014/979147
Research Article

A Probabilistic Recommendation Method Inspired by Latent Dirichlet Allocation Model

1Web Sciences Center, School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu 611731, China
2Big Data Research Center, University of Electronic Science and Technology of China, Chengdu 611731, China

Received 27 May 2014; Accepted 15 August 2014; Published 29 September 2014

Academic Editor: Qinggang Meng

Copyright © 2014 WenBo Xie et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. J. B. Schafer, D. Frankowski, J. Herlocker, and S. Sen, “Collaborative filtering recommender systems,” Lecture Notes in Computer Science, vol. 4321, pp. 291–324, 2007. View at Google Scholar · View at Scopus
  2. B. Sarwar, G. Karypis, and J. Konstan, “Item-based collaborative filtering recommendation algorithms,” in Proceedings of the 10th international conference on World Wide Web (WWW '01), 2001, Item-Based Collaborative Filtering Recommendation Algorithms,.
  3. M. J. Pazzani and D. Billsus, “Content-based recommendation systems,” in The Adaptive Web, vol. 4321 of Lecture Notes in Computer Science, pp. 325–341, Springer, 2007. View at Google Scholar
  4. K. Goldberg, T. Roeder, D. Gupta, and C. Perkins, “Eigentaste: a constant time collaborative filtering algorithm,” Information Retrieval, vol. 4, no. 2, pp. 133–151, 2001. View at Publisher · View at Google Scholar · View at Scopus
  5. S. Maslov and Y.-C. Zhang, “Extracting hidden information from knowledge networks,” Physical Review Letters, vol. 87, no. 24, Article ID 248701, 2001. View at Google Scholar · View at Scopus
  6. P. Laureti, L. Moret, Y. Zhang, and Y. Yu, “Information filtering via iterative refinement,” Europhysics Letters, vol. 75, no. 6, pp. 1006–1012, 2006. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  7. J. Ren, T. Zhou, and Y.-C. Zhang, “Information filtering via self-consistent refinement,” Europhysics Letters, vol. 82, Article ID 58007, 2008. View at Publisher · View at Google Scholar · View at Scopus
  8. R. Agrawal, T. Imielinski, and A. Swami, “Mining association rules between sets of items in large databases,” in Proceedings of the 1993 ACM SIGMOD international conference on Management of data (SIGMOD '93), vol. 22, no. 2, pp. 207–216.
  9. W. Lin, S. A. Alvarez, and C. Ruiz, “Efficient adaptive-support association rule mining for recommender systems,” Data Mining and Knowledge Discovery, vol. 6, no. 1, pp. 83–105, 2002. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  10. D. M. Blei, A. Y. Ng, and M. I. Jordan, “Latent Dirichlet allocation,” Journal of Machine Learning Research, vol. 3, no. 4-5, pp. 993–1022, 2003. View at Google Scholar · View at Scopus
  11. T. L. Griffiths and M. Steyvers, “Finding scientific topic,” Proceedings of the National Academy of Sciences of the United States of America, vol. 101, no. 1, 2004. View at Google Scholar
  12. D. M. Blei and J. D. Lafferty, “Correlated topicmodels,” in Advances in Neural Information Processing Systems, vol. 18, 2005. View at Google Scholar
  13. F.-F. Li and P. Perona, “A bayesian hierarchical model for learning natural scene categories,” in Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR '05), vol. 2, pp. 524–531, June 2005. View at Scopus
  14. X. Wei and W. B. Croft, “LDA-based document models for ad-hoc retrieval,” in Proceedings of the 29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR '06), pp. 178–185, August 2006. View at Scopus
  15. Z. Wang and X. Qian, “Text categorization based on LDA and SVM,” in Proceedings of the International Conference on Computer Science and Software Engineering (CSSE '08), vol. 1, pp. 674–677, December 2008. View at Publisher · View at Google Scholar · View at Scopus
  16. D. Ramage, P. Heymann, C. D. Manning, and H. Garcia-Molina, “Clustering the tagged web,” in Proceeding of the 2nd ACM International Conference on Web Search and Data Mining (WSDM '09), pp. 54–63, New York, NY, USA, February 2009. View at Publisher · View at Google Scholar · View at Scopus
  17. K. Yu, B. Zhang, H. Zhu, H. Cao, and J. Tian, “Towards personalized context-aware recommendation by mining context logs through topic models,” Lecture Notes in Computer Science, vol. 7301, no. 1, pp. 431–443, 2012. View at Publisher · View at Google Scholar · View at Scopus
  18. R. Krestel, P. Fankhauser, and W. Nejdl, “Latent Dirichlet allocation for tag recommendation,” in Proceedings of the 3rd ACM Conference on Recommender Systems, pp. 61–68, October 2009. View at Publisher · View at Google Scholar · View at Scopus
  19. Y. Song, L. Zhang, and C. L. Giles, “Automatic tag recommendation algorithms for social recommender systems,” ACM Transactions on the Web, vol. 5, article 4, no. 1, 2011. View at Publisher · View at Google Scholar · View at Scopus
  20. X. Si and M. Sun, “Tag-LDA for scalable real-time tag recommendation,” Journal of Computational Information Systems, vol. 6, no. 1, pp. 23–31, 2009. View at Google Scholar
  21. J.-H. Kang, K. Lerman, and L. Getoor, “LA-LDA: a limited attention topic model for social recommendation,” in Social Computing, Behavioral-Cultural Modeling and Prediction, vol. 7812 of Lecture Notes in Computer Science, pp. 211–220, Springer, Berlin, Germany, 2013. View at Publisher · View at Google Scholar
  22. T. Hofmann, “Unsupervised learning by probabilistic Latent Semantic Analysis,” Machine Learning, vol. 42, no. 1-2, pp. 177–196, 2001. View at Publisher · View at Google Scholar · View at Scopus