Mexican International Conference on Artificial Intelligence

Advances in Artificial Intelligence and Its Applications pp 67-79 | Cite as

SVD-LDA: Topic Modeling for Full-Text Recommender Systems

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9414)

Abstract

In recommender systems, matrix decompositions, in particular singular value decomposition (SVD), represent users and items as vectors of features and allow for additional terms in the decomposition to account for other available information. In text mining, topic modeling, in particular latent Dirichlet allocation (LDA), are designed to extract topical content of a large corpus of documents. In this work, we present a unified SVD-LDA model that aims to improve SVD-based recommendations for items with textual content with topic modeling of this content. We develop a training algorithm for SVD-LDA based on a first order approximation to Gibbs sampling and show significant improvements in recommendation quality.

Notes

Acknowledgements

This work was supported by the Samsung Research Center grant “Recommendation Systems based on Probabilistic Graphical Models”, the Government of the Russian Federation grant 14.Z50.31.0030, and the Russian Foundation for Basic Research grant no. 15-29-01173.

References

  1. 1.
    Resnick, P., Iacovou, N., Sushak, M., Bergstrom, P., Riedl, J.T.: Grouplens: an open architecture for collaborative filtering of netnews. In: 1994 ACM Conference on Computer Supported Collaborative Work Conference, pp. 175–186, Chapel Hill, NC, Association of Computing Machinery (1994)Google Scholar
  2. 2.
    Said, A., Jain, B.J., Albayrak, S.: Analyzing weighting schemes in collaborative filtering: cold start, post cold start and power users. In: Proceedings of the 27th Annual ACM Symposium on Applied Computing, SAC 2012, pp. 2035–2040, New York (2012)Google Scholar
  3. 3.
    Koren, Y., Bell, R.M.: Advances in collaborative filtering. In: Ricci, F., Rokach, L., Shapira, B., Kantor, P.B. (eds.) Recommender Systems Handbook, pp. 145–186. Springer, US (2011)CrossRefGoogle Scholar
  4. 4.
    Hu, Y., Koren, Y., Volinsky, C.: Collaborative filtering for implicit feedback datasets. In: Proceedings of the 8th IEEE International Conference on Data Mining, pp. 263–272, Pisa, Italy. IEEE Computer Society (2008)Google Scholar
  5. 5.
    Hoffmann, T.: Unsupervised learning by probabilistic latent semantic analysis. Mach. Learn. 42, 177–196 (2001)CrossRefGoogle Scholar
  6. 6.
    Blei, D.M., Ng, A.Y., Jordan, M.I.: Latent Dirichlet allocation. J. Mach. Learn. Res. 3, 993–1022 (2003)MATHGoogle Scholar
  7. 7.
    Griffiths, T., Steyvers, M.: Finding scientific topics. Proc. Nat. Acad. Sci. 101(Suppl. 1), 5228–5335 (2004)CrossRefGoogle Scholar
  8. 8.
    Blei, D.M., McAuliffe, J.D.: Supervised topic models. In: Advances in Neural Information Processing Systems, vol. 22 (2007)Google Scholar
  9. 9.
    Linden, G., Smith, B., York, J.: Amazon.com recommendations: item-to-item collaborative filtering. IEEE Internet Computing 7(1), 76–80 (2003)CrossRefGoogle Scholar
  10. 10.
    Agarwal, D., Chen, B.C.: fLDA: matrix factorization through latent Dirichlet allocation. In: Proceedings of the 3rd WSDM, pp. 91–100, New York. ACM (2010)Google Scholar
  11. 11.
    Agarwal, D., Chen, B.C.: Regression-based latent factor models. In: Proceedings of the 15th KDD, pp. 19–28 New York. ACM (2009)Google Scholar
  12. 12.
    Jarvelin, K., Kekalainen, J.: Cumulated gain-based evaluation of IR techniques. ACM Trans. Inf. Syst. 20, 422–446 (2002)CrossRefGoogle Scholar
  13. 13.
    Fawcett, T.: An introduction to ROC analysis. Pattern Recogn. Lett. 27, 861–874 (2006)CrossRefGoogle Scholar
  14. 14.
    Ling, C.X., Huang, J., Zhang, H.: AUC: a statistically consistent and more discriminating measure than accuracy. In: Proceedings of the International Joint Conference on Artificial Intelligence 2003, pp. 519–526 (2003)Google Scholar
  15. 15.
    Potapenko, A., Vorontsov, K.: Robust PLSA performs better than LDA. In: Serdyukov, P., Braslavski, P., Kuznetsov, S.O., Kamps, J., Rüger, S., Agichtein, E., Segalovich, I., Yilmaz, E. (eds.) ECIR 2013. LNCS, vol. 7814, pp. 784–787. Springer, Heidelberg (2013) CrossRefGoogle Scholar
  16. 16.
    Vorontsov, K.: Additive regularization for topic models of text collections. Doklady Mathematics 89, 301–304 (2014)CrossRefMathSciNetMATHGoogle Scholar
  17. 17.
    Cao, L., Fei-Fei, L.: Spatially coherent latent topic model for concurrent segmentation and classification of objects and scenes. In: IEEE 11th International Conference on Computer Vision, ICCV 2007, pp. 1–8 (2007)Google Scholar
  18. 18.
    Hu, D., Saul, L.K.: A probabilistic topic model for unsupervised learning of musical key-profiles. In: Hirata, K., Tzanetakis, G., Yoshii, K. (eds.) ISMIR, International Society for Music Information Retrieval, pp. 441–446 (2009)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Steklov Institute of Mathematics at St. PetersburgSt. PetersburgRussia
  2. 2.Laboratory for Internet Studies, National Research University – Higher School of EconomicsSt. PetersburgRussia
  3. 3.Kazan (Volga Region) Federal UniversityKazanRussia

Personalised recommendations