ABSTRACT
A key challenge in recommender system research is how to effectively profile new users, a problem generally known as cold-start recommendation. Recently the idea of progressively querying user responses through an initial interview process has been proposed as a useful new user preference elicitation strategy. In this paper, we present functional matrix factorization (fMF), a novel cold-start recommendation method that solves the problem of initial interview construction within the context of learning user and item profiles. Specifically, fMF constructs a decision tree for the initial interview with each node being an interview question, enabling the recommender to query a user adaptively according to her prior responses. More importantly, we associate latent profiles for each node of the tree --- in effect restricting the latent profiles to be a function of possible answers to the interview questions --- which allows the profiles to be gradually refined through the interview process based on user responses. We develop an iterative optimization algorithm that alternates between decision tree construction and latent profiles extraction as well as a regularization scheme that takes into account of the tree structure. Experimental results on three benchmark recommendation data sets demonstrate that the proposed fMF algorithm significantly outperforms existing methods for cold-start recommendation.
- G. Adomavicius and a. Tuzhilin. Toward the next generation of recommender systems: a survey of the state-of-the-art and possible extensions. IEEE Transactions on Knowledge and Data Engineering, 17(6):734--749, June 2005. Google ScholarDigital Library
- D. Agarwal and B.-C. Chen. Regression-based latent factor models. Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining - KDD'09, page 19, 2009. Google ScholarDigital Library
- J. Basilico and T. Hofmann. Unifying collaborative and content-based filtering. Twenty-first international conference on Machine learning - ICML'04, page 9, 2004. Google ScholarDigital Library
- C. Boutilier, R. Zemel, and B. Marlin. Active collaborative filtering. In Proceedings of the Nineteenth Conference on Uncertainty in Artificial Intelligence, pages 98--106. Citeseer, 2003. Google ScholarDigital Library
- J. Breese, D. Heckerman, C. Kadie, and Others. Empirical analysis of predictive algorithms for collaborative filtering. In Proceedings of the 14th conference on Uncertainty in Artificial Intelligence, pages 43--52, 1998. Google ScholarDigital Library
- L. Breiman, J. Friedman, R. Olshen, and C. Stone. Classification and Regression Trees. Wadsworth and Brooks, Monterey, CA, 1984.Google Scholar
- N. Golbandi, Y. Koren, and R. Lempel. On bootstrapping recommender systems. In Proceedings of the 19th ACM international conference on Information and knowledge management, pages 1805--1808. ACM, 2010. Google ScholarDigital Library
- N. Golbandi, Y. Koren, and R. Lempel. Adaptive Bootstrapping of Recommender Systems Using Decision Trees. WSDM, 2011. Google ScholarDigital Library
- K. Goldberg, T. Roeder, D. Gupta, and C. Perkins. Eigentaste: A constant time collaborative filtering algorithm. Information Retrieval, 4(2):133--151, 2001. Google ScholarDigital Library
- A. Gunawardana and C. Meek. Tied boltzmann machines for cold start recommendations. In Proceedings of the 2008 ACM conference on Recommender systems, pages 19--26, New York, New York, USA, 2008. ACM. Google ScholarDigital Library
- A. Harpale and Y. Yang. Personalized active learning for collaborative filtering. In Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval, pages 91--98. ACM, 2008. Google ScholarDigital Library
- T. Hofmann. Latent semantic models for collaborative filtering. ACM Transactions on Information Systems, 22(1):89--115, Jan. 2004. Google ScholarDigital Library
- R. Jin and L. Si. A Bayesian approach toward active learning for collaborative filtering. In Proceedings of the 20th conference on Uncertainty in artificial intelligence, pages 278--285. AUAI Press, 2004. Google ScholarDigital Library
- Y. Koren. Factor in the neighbors: Scalable and accurate collaborative filtering. ACM Transactions on Knowledge Discovery from Data (TKDD), 4(1):1--24, 2010. Google ScholarDigital Library
- S.-T. Park and W. Chu. Pairwise preference regression for cold-start recommendation. Proceedings of the third ACM conference on Recommender systems - RecSys'09, page 21, 2009. Google ScholarDigital Library
- A. Paterek. Improving regularized singular value decomposition for collaborative filtering. In Proceedings of KDD Cup and Workshop, volume 2007, pages 5--8. Citeseer, 2007.Google Scholar
- D. Pennock, E. Horvitz, S. Lawrence, and C. Giles. Collaborative filtering by personality diagnosis: A hybrid memory-and model-based approach. In Proceedings of the 16th conference on uncertainty in artificial intelligence, pages 473--480. Citeseer, 2000. Google ScholarDigital Library
- P. Pu and L. Chen. User-involved preference elicitation for product search and recommender systems. AI Magazine, 29(4):93, 2009.Google ScholarCross Ref
- A. Rashid, I. Albert, D. Cosley, S. Lam, S. McNee, J. Konstan, and J. Riedl. Getting to know you: learning new user preferences in recommender systems. In Proceedings of the 7th international conference on Intelligent user interfaces, pages 127--134. ACM, 2002. Google ScholarDigital Library
- A. M. Rashid, G. Karypis, and J. Riedl. Learning Preferences of New Users in Recommender Systems: An Information Theoretic Approach. SIGKDD Workshop on Web Mining and Web Usage Analysis, 22, Oct. 2008. Google ScholarDigital Library
- S. Rendle, C. Freudenthaler, and L. Schmidt-Thieme. Factorizing personalized Markov chains for next-basket recommendation. Proceedings of the 19th international conference on World wide web - WWW'10, page 811, 2010. Google ScholarDigital Library
- J. Rennie and N. Srebro. Fast maximum margin matrix factorization for collaborative prediction. In Proceedings of the 22nd international conference on Machine learning, pages 713--719. ACM, 2005. Google ScholarDigital Library
- A. I. Schein, A. Popescul, L. H. Ungar, and D. M. Pennock. Methods and metrics for cold-start recommendations. Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR'02, page 253, 2002. Google ScholarDigital Library
- N. Srebro, J. Rennie, and T. Jaakkola. Maximum-margin matrix factorization. Advances in neural information processing systems, 17:1329--1336, 2005.Google Scholar
- D. Stern, R. Herbrich, and T. Graepel. Matchbox: large scale online bayesian recommendations. In Proceedings of the 18th international conference on World wide web, pages 111--120. ACM, 2009. Google ScholarDigital Library
- X. Su and T. M. Khoshgoftaar. A Survey of Collaborative Filtering Techniques. Advances in Artificial Intelligence, 2009(Section 3):1--20, 2009. Google ScholarDigital Library
Index Terms
- Functional matrix factorizations for cold-start recommendation
Recommendations
Addressing cold-start in app recommendation: latent user models constructed from twitter followers
SIGIR '13: Proceedings of the 36th international ACM SIGIR conference on Research and development in information retrievalAs a tremendous number of mobile applications (apps) are readily available, users have difficulty in identifying apps that are relevant to their interests. Recommender systems that depend on previous user ratings (i.e., collaborative filtering, or CF) ...
Naïve filterbots for robust cold-start recommendations
KDD '06: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data miningThe goal of a recommender system is to suggest items of interest to a user based on historical behavior of a community of users. Given detailed enough history, item-based collaborative filtering (CF) often performs as well or better than almost any ...
An empirical study of a cross-level association rule mining approach to cold-start recommendations
We propose a novel hybrid recommendation approach to address the well-known cold-start problem in Collaborative Filtering (CF). Our approach makes use of Cross-Level Association RulEs (CLARE) to integrate content information about domain items into ...
Comments