The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Functional matrix factorizations for cold-start recommendation
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Classification And Regression Trees
Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (2017) · doi:10.1201/9781315139470 · Cited by 11,417
Adomavicius, G., & Tuzhilin, A. (2005) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2005.99 · Cited by 10,310
Empirical Analysis of Predictive Algorithms for Collaborative Filtering
Breese, J. S., Heckerman, D. E., & Kadie, C. M. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1301.7363 · Cited by 4,772
A Survey of Collaborative Filtering Techniques
Su, X., & Khoshgoftaar, T. M. (2009) · Advances in Artificial Intelligence · doi:10.1155/2009/421425 · Cited by 3,602
Factorizing personalized Markov chains for next-basket recommendation
Rendle, S., Freudenthaler, C., & Schmidt-Thieme, L. (2010) · Proceedings of the 19th international conference on World wide web · doi:10.1145/1772690.1772773 · Cited by 2,692
Methods and metrics for cold-start recommendations
Schein, A. I., Popescul, A., Ungar, L. H., & Pennock, D. M. (2002) · Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/564376.564421 · Cited by 1,780
Proceedings of the 20th conference on Uncertainty in artificial intelligence
Meek, C., Chickering, M., & Halpern, J. Y. (2004) · Cited by 1,574
Eigentaste: A Constant Time Collaborative Filtering Algorithm
Goldberg, K., Roeder, T., Gupta, D., & Perkins, C. (2001) · Information Retrieval · doi:10.1023/a:1011419012209 · Cited by 1,438
Latent semantic models for collaborative filtering
Hofmann, T. (2004) · ACM Transactions on Information Systems · doi:10.1145/963770.963774 · Cited by 1,378
Maximum-Margin Matrix Factorization
Srebro, N., Rennie, J. D. M., & Jaakkola, T. (2004) · Cited by 962
Fast maximum margin matrix factorization for collaborative prediction
Rennie, J. D. M., & Srebro, N. (2005) · Proceedings of the 22nd international conference on Machine learning - ICML '05 · doi:10.1145/1102351.1102441 · Cited by 939
Factor in the neighbors: Scalable and accurate collaborative filtering
Koren, Y. (2010) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/1644873.1644874 · Cited by 718
Getting to know you: learning new user preferences in recommender systems
Rashid, A. M., Albert, I., Cosley, D., Lam, S. K., McNee, S. M., Konstan, J. A., & Riedl, J. (2002) · Proceedings of the 7th international conference on Intelligent user interfaces · doi:10.1145/502716.502737 · Cited by 545
Regression-based latent factor models
Agarwal, D., & Chen, B.-C. (2009) · Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1557019.1557029 · Cited by 514
Collaborative Filtering by Personality Diagnosis: A Hybrid Memory- and Model-Based Approach
Pennock, D. M., Horvitz, E., Lawrence, S., & Giles, C. L. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1301.3885 · Cited by 499
Proceedings of the 16th Conference on Uncertainty in Artificial Intelligence
Boutilier, C. E., & Goldszmidt, M. (2000) · Cited by 359
Unifying collaborative and content-based filtering
Basilico, J., & Hofmann, T. (2004) · International Conference on Machine Learning · doi:10.1145/1015330.1015394 · Cited by 352
Pairwise preference regression for cold-start recommendation
Park, S.-T., & Chu, W. (2009) · Proceedings of the third ACM conference on Recommender systems · doi:10.1145/1639714.1639720 · Cited by 311
Learning preferences of new users in recommender systems: an information theoretic approach
Rashid, A. M., Karypis, G., & Riedl, J. (2008) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1540276.1540302 · Cited by 243
Matchbox: large scale online bayesian recommendations
Stern, D. H., Herbrich, R., & Graepel, T. (2009) · Proceedings of the 18th international conference on World wide web · doi:10.1145/1526709.1526725 · Cited by 221
Adaptive bootstrapping of recommender systems using decision trees
Golbandi, N., Koren, Y., & Lempel, R. (2011) · Proceedings of the fourth ACM international conference on Web search and data mining · doi:10.1145/1935826.1935910 · Cited by 167
Proceedings of the Nineteenth Conference on Uncertainty in Artificial Intelligence (2003)Preprint
Meek, C., & Kjaerulff, U. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1301.4606 · Cited by 124
Personalized active learning for collaborative filtering
Harpale, A., & Yang, Y. (2008) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/1390334.1390352 · Cited by 124
User‐Involved Preference Elicitation for Product Search and Recommender Systems
Pu, P., & Chen, L. (2008) · AI Magazine · doi:10.1609/aimag.v29i4.2200 · Cited by 117
A Bayesian Approach toward Active Learning for Collaborative FilteringPreprint
Jin, R., & Si, L. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1207.4146 · Cited by 109
On bootstrapping recommender systems
Golbandi, N., Koren, Y., & Lempel, R. (2010) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/1871437.1871734 · Cited by 97
Tied boltzmann machines for cold start recommendations
Gunawardana, A., & Meek, C. (2008) · ACM Conference on Recommender Systems (RecSys) · doi:10.1145/1454008.1454013 · Cited by 88
Cited by
Image-Based Recommendations on Styles and Substitutes
McAuley, J., Targett, C., Shi, Q., & van den Hengel, A. (2015) · Proceedings of the 38th International ACM SIGIR Conference on Research and Development in Information Retrieval · doi:10.1145/2766462.2767755 · Cited by 2,280
Collaborative filtering and deep learning based recommendation system for cold start items
Wei, J., He, J., Chen, K., Zhou, Y., & Tang, Z. (2017) · Expert Systems with Applications · doi:10.1016/j.eswa.2016.09.040 · Cited by 715
Facing the cold start problem in recommender systems
Lika, B., Kolomvatsos, K., & Hadjiefthymiades, S. (2014) · Expert Systems with Applications · doi:10.1016/j.eswa.2013.09.005 · Cited by 658
Inferring Networks of Substitutable and Complementary Products
McAuley, J., Pandey, R., & Leskovec, J. (2015) · Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2783258.2783381 · Cited by 645
“Although it is promising that we are able to recommend substitutes and complements from the text of product reviews, an obvious question remains as to what can be done for new products, that do not yet have any reviews associated with them, known as the ‘cold-start’ problem in recommender systems [16, 24, 27, 30, 36].”
BackgroundCross-Domain Recommendation: An Embedding and Mapping Approach
Man, T., Shen, H., Jin, X., & Cheng, X. (2017) · Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2017/343 · Cited by 439
Metadata
- Authors
- Zhou, K., Yang, S.-H., & Zha, H.
- Venue
- Proceedings of the 34th international ACM SIGIR conference on Research and development in Information Retrieval
- Publisher
- ACM
- Published
- 2011-07-24
- Pages
- 315-324
- OpenAlex
- W2018571751
- Cited by
- 262
- References
- 27
- FWCI
- 13.22
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.