ECML PKDD 2010: Machine Learning and Knowledge Discovery in Databases pp 483-498 | Cite as
Topic Modeling for Personalized Recommendation of Volatile Items
Abstract
One of the major strengths of probabilistic topic modeling is the ability to reveal hidden relations via the analysis of co-occurrence patterns on dyadic observations, such as document-term pairs. However, in many practical settings, the extreme sparsity and volatility of co-occurrence patterns within the data, when the majority of terms appear in a single document, limits the applicability of topic models. In this paper, we propose an efficient topic modeling framework in the presence of volatile dyadic observations when direct topic modeling is infeasible. We show both theoretically and empirically that often-available unstructured and semantically-rich meta-data can serve as a link between dyadic sets, and can allow accurate and efficient inference. Our approach is general and can work with most latent variable models, which rely on stable dyadic data, such as pLSI, LDA, and GaP. Using transactional data from a major e-commerce site, we demonstrate the effectiveness as well as the applicability of our method in a personalized recommendation system for volatile items. Our experiments show that the proposed learning method outperforms the traditional LDA by capturing more persistent relations between dyadic sets of wide and practical significance.
Keywords
Gibbs Sampler Topic Model Search Query Latent Variable Model Latent TopicReferences
- 1.Adomavicius, G., Tuzhilin, A.: Toward the next generation of recommender systems: A survey of the state-of-the-art and possible extensions. IEEE Tr. on Knowl. and Data Eng. 17(6), 734–749 (2005)CrossRefGoogle Scholar
- 2.Agarwal, D., Chen, B.: fLDA: Matrix factorization through latent Dirichlet allocation. In: Proc. WSDM (2010)Google Scholar
- 3.Bell, R., Koren, Y., Volinsky, C.: Modeling relationships at multiple scales to improve accuracy of large recommender systems. In: Proc. KDD, pp. 95–104 (2007)Google Scholar
- 4.Blei, D.M., Ng, A.Y., Jordan, M.I.: Latent Dirichlet allocation. J. Mach. Learn. Res. 3, 993–1022 (2003)MATHCrossRefGoogle Scholar
- 5.Canny, J.: GaP: a factor model for discrete data. In: Proc. SIGIR, pp. 122–129 (2004)Google Scholar
- 6.Chen, Y., Canny, J.: Probabilistic clustering of an item. U.S. Patent Application 12/694,885, filed with eBay (2010)Google Scholar
- 7.Chen, Y., Pavlov, D., Canny, J.: Large-scale behavioral targeting. In: Proc. KDD, pp. 209–218 (2009)Google Scholar
- 8.Das, A.S., Datar, M., Garg, A., Rajaram, S.: Google news personalization: scalable online collaborative filtering. In: Proc. WWW, pp. 271–280 (2007)Google Scholar
- 9.Fei-Fei, L., Perona, P.: A Bayesian hierarchical model for learning natural scene categories. In: CVPR, pp. 524–531 (2005)Google Scholar
- 10.Girolami, M., Kabán, A.: On an equivalence between pLSI and LDA. In: Proc. SIGIR, pp. 433–434 (2003)Google Scholar
- 11.Griffiths, T.L., Steyvers, M.: Finding scientific topics. Proc. Natl. Acad. Sci. U.S. 101, 5228–5235 (2004)CrossRefGoogle Scholar
- 12.Hofmann, T.: Probabilistic latent semantic analysis. In: Proc. UAI, pp. 289–296 (1999)Google Scholar
- 13.Koren, Y.: Factorization meets the neighborhood: a multifaceted collaborative filtering model. In: Proc. KDD, pp. 426–434 (2008)Google Scholar
- 14.Liu, Y., Zha, H., Qin, H.: Shape topics: A compact representation and new algorithms for 3d partial shape retrieval. In: Proc. CVPR, vol. 2, pp. 2025–2032 (2006)Google Scholar
- 15.Micarelli, A., Gasparetti, F., Sciarrone, F., Gauch, S.: Personalized search on the World Wide Web. In: The Adaptive Web, pp. 195–230 (2007)Google Scholar
- 16.Mimno, D., Wallach, H.M., Naradowsky, J., Smith, D.A., McCallum, A.: Polylingual topic models. In: Proc. EMNLP, pp. 880–889 (2009)Google Scholar
- 17.Steyvers, M., Griffiths, T.: Probabilistic topic models. In: Handbook of Latent Semantic Analysis, pp. 424–440 (2007)Google Scholar
- 18.Wetzker, R., Umbrath, W., Said, A.: A hybrid approach to item recommendation in folksonomies. In: Proc. WSDM, pp. 25–29. ACM, New York (2009)Google Scholar