The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Learning Attribute-to-Feature Mappings for Cold-Start Recommendations
Abstract
Cold-start scenarios in recommender systems are situations in which no prior events, like ratings or clicks, are known for certain users or items. To compute predictions in such cases, additional information about users (user attributes, e.g. gender, age, geographical location, occupation) and items (item attributes, e.g. genres, product categories, keywords) must be used. We describe a method that maps such entity (e.g. user or item) attributes to the latent features of a matrix (or higher-dimensional) factorization model. With such mappings, the factors of a MF model trained by standard techniques can be applied to the new-user and the new-item problem, while retaining its advantages, in particular speed and predictive accuracy. We use the mapping concept to construct an attribute-aware matrix factorization model for item recommendation from implicit, positive-only feedback. Experiments on the new-item problem show that this approach provides good predictive accuracy, while the prediction time only grows by a constant factor.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
(2003) · Journal of Machine Learning Research · doi:10.5555/944919.944937 · Cited by 32,337
The Elements of Statistical Learning
Hastie, T., Friedman, J., & Tibshirani, R. (2001) · Springer Series in Statistics · doi:10.1007/978-0-387-21606-5 · Cited by 24,162
A tutorial on support vector regression
Smola, A. J., & Schölkopf, B. (2004) · Statistics and Computing · doi:10.1023/b:stco.0000035301.49549.88 · Cited by 13,387
Introduction to information retrieval
(2009) · Choice Reviews Online · doi:10.5860/choice.46-2715 · Cited by 12,278
Blei, D. M., Ng, A. Y., & Jordan, M. I. (2002) · Advances in Neural Information Processing Systems 14 · doi:10.7551/mitpress/1120.003.0082 · Cited by 12,223
Matrix Factorization Techniques for Recommender Systems
Koren, Y., Bell, R., & Volinsky, C. (2009) · Computer · doi:10.1109/mc.2009.263 · Cited by 11,673
Introduction to Information Retrieval
Manning, C. D., Raghavan, P., & Schütze, H. (2008) · doi:10.1017/cbo9780511809071 · Cited by 11,288
BPR: Bayesian Personalized Ranking from Implicit Feedback
Rendle, S., Freudenthaler, C., Gantner, Z., & Schmidt-Thieme, L. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1205.2618 · Cited by 4,242
Self-citationSome Mathematical Notes on Three-Mode Factor Analysis
Tucker, L. R. (1966) · Psychometrika · doi:10.1007/bf02289464 · Cited by 3,492
Content-Based Recommendation Systems
Pazzani, M. J., & Billsus, D. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-72079-9_10 · Cited by 2,600
Harshman, R. A. (1970) · Cited by 2,255
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
One-Class Collaborative Filtering
Pan, R., Zhou, Y., Cao, B., Liu, N. N., Lukose, R., Scholz, M., & Yang, Q. (2008) · 2008 Eighth IEEE International Conference on Data Mining · doi:10.1109/icdm.2008.16 · Cited by 1,015
Pairwise interaction tensor factorization for personalized tag recommendation
Rendle, S., & Schmidt-Thieme, L. (2010) · Proceedings of the third ACM international conference on Web search and data mining · doi:10.1145/1718487.1718498 · Cited by 675
Self-citationRegression-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
Latent Class Models for Collaborative Filtering
Hofmann, T., & Puzicha, J. (1999) · Cited by 428
Sarwar, B. M., Konstan, J. A., Borchers, A., Herlocker, J., Miller, B., & Riedl, J. (1998) · Proceedings of the 1998 ACM conference on Computer supported cooperative work · doi:10.1145/289444.289509 · Cited by 395
Implicit Feedback for Recommender Systems
Oard, D. W., & Kim, J. (1998) · Scholar Commons (University of South Carolina) · Cited by 371
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
fLDA: matrix factorization through latent dirichlet allocation
Agarwal, D., & Chen, B.-C. (2010) · Proceedings of the third ACM international conference on Web search and data mining · doi:10.1145/1718487.1718499 · Cited by 256
TiVo: making show recommendations using a distributed collaborative filtering architecture
Ali, K., & van Stam, W. (2004) · Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1014052.1014097 · Cited by 197
A unified approach to building hybrid recommender systems
Gunawardana, A., & Meek, C. (2009) · Proceedings of the third ACM conference on Recommender systems · doi:10.1145/1639714.1639735 · Cited by 158
A learning agent for wireless news access
Billsus, D., Pazzani, M. J., & Chen, J. (2000) · ACM International Conference on Intelligent User Interfaces (IUI) · doi:10.1145/325737.325768 · Cited by 121
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
Factorization Machines with libFM
Rendle, S. (2012) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/2168752.2168771 · Cited by 1,337
Self-citationHeterogeneous Information Network Embedding for Recommendation
Shi, C., Hu, B., Zhao, W. X., & Yu, P. S. (2019) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2018.2833443 · Cited by 1,204
Shi, Y., Larson, M., & Hanjalic, A. (2014) · ACM Computing Surveys · doi:10.1145/2556270 · Cited by 806
Link Prediction via Matrix Factorization
Menon, A. K., & Elkan, C. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-23783-6_28 · Cited by 520
Geng, S., Liu, S., Fu, Z., Ge, Y., & Zhang, Y. (2022) · Proceedings of the 16th ACM Conference on Recommender Systems · doi:10.1145/3523227.3546767 · Cited by 556
Metadata
- Authors
- Gantner, Z., Drumond, L., Freudenthaler, C., Rendle, S., & Schmidt-Thieme, L.
- Venue
- 2010 IEEE International Conference on Data Mining
- Publisher
- IEEE
- Published
- 2010-12
- Pages
- 176-185
- ISSN
- 1550-4786 (ISSN-L)
- OpenAlex
- W2102982709
- Cited by
- 289
- References
- 25
- FWCI
- 9.44
- 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.