skip to main content
10.1145/2043932.2043940acmconferencesArticle/Chapter ViewAbstractPublication PagesrecsysConference Proceedingsconference-collections
research-article

Generalizing matrix factorization through flexible regression priors

Published: 23 October 2011 Publication History

Abstract

Predicting user "ratings" on items is a crucial task in recommender systems. Matrix factorization methods that computes a low-rank approximation of the incomplete user-item rating matrix provide state-of-the-art performance, especially for users and items with several past ratings (warm starts). However, it is a challenge to generalize such methods to users and items with few or no past ratings (cold starts). Prior work [4][32] have generalized matrix factorization to include both user and item features for performing better regularization of factors as well as provide a model for smooth transition from cold starts to warm starts. However, the features were incorporated via linear regression on factor estimates. In this paper, we generalize this process to allow for arbitrary regression models like decision trees, boosting, LASSO, etc. The key advantage of our approach is the ease of computing --- any new regression procedure can be incorporated by "plugging" in a standard regression routine into a few intermediate steps of our model fitting procedure. With this flexibility, one can leverage a large body of work on regression modeling, variable selection, and model interpretation. We demonstrate the usefulness of this generalization using the MovieLens and Yahoo! Buzz datasets.

References

[1]
KDD cup and workshop. 2007.
[2]
J. Abernethy, F. Bach, T. Evgeniou, and J.-P. Vert. Low-rank matrix factorization with attributes. CoRR, abs/cs/0611124, 2006.
[3]
J. Abernethy, F. R. Bach, T. Evgeniou, and J.-P. Vert. A new approach to collaborative filtering:operator estimation with spectral regularization. JMLR, 2009.
[4]
D. Agarwal and B. Chen. Regression-based latent factor models. In KDD, 2009.
[5]
D. Agarwal and B. Chen. fLDA: matrix factorization through latent Dirichlet allocation. In WSDM, 2010.
[6]
D. Agarwal, B. Chen, P. Elango, N. Motgi, S. Park, R. Ramakrishnan, S. Roy, and J. Zachariah. Online models for content optimization. In NIPS, 2009.
[7]
M. Balabanovic and Y. Shoham. Fab: content-based, collaborative recommendation. Comm. of the ACM, 1997.
[8]
R. Bell, Y. Koren, and C. Volinsky. Modeling relationships at multiple scales to improve accuracy of large recommender systems. In KDD, 2007.
[9]
J. Booth and J. Hobert. Maximizing generalized linear mixed model likelihoods with an automated monte carlo EM algorithm. J. R. Statist. Soc. B, 1999.
[10]
J. S. Breese, D. Heckerman, and C. M. Kadie. Empirical analysis of predictive algorithms for collaborative filtering. In UAI, 1998.
[11]
L. Breiman. Classification and regression trees. Chapman & Hall/CRC, 1984.
[12]
L. Breiman. Random forests. Machine learning, 2001.
[13]
A. Z. Broder. Computational advertising and recommender systems. In RecSys, 2008.
[14]
H. Chipman, E. George, and R. McCulloch. BART: Bayesian additive regression trees. Annals of applied statistics, 2010.
[15]
M. Claypool and A. Gokhale, et al. Combining content-based and collaborative filters in an online newspaper. In RecSys Workshop, 1999.
[16]
A. P. Dempster, N. M. Laird, and D. B. Rubin. Maximum likelihood from incomplete data via the EM algorithm. J. R. Statist. Soc. B, 1977.
[17]
J. Friedman. Greedy function approximation: a gradient boosting machine. Annals of Statistics, 2001.
[18]
A. E. Gelfand. Gibbs sampling. JASA, 1995.
[19]
N. Good and J. B. Schafer, et al. Combining collaborative filtering with personal agents for better recommendations. In AAAI, 1999.
[20]
P. Green. Penalized likelihood for general semi-parametric regression models. International Statistical Review/Revue Internationale de Statistique, 1987.
[21]
T. Hastie, R. Tibshirani, and J. Friedman. The Elements of Statistical Learning. Springer-Verlag, 2009.
[22]
N. Lawrence and R. Urtasun. Non-linear matrix factorization with gaussian processes. In ICML, 2009.
[23]
P. McCullagh and J. A. Nelder. Generalized Linear Models. Chapman & Hall/CRC, 1989.
[24]
P. Melville, R. J. Mooney, and R. Nagarajan. Content-boosted collaborative filtering for improved recommendations. In AAAI, 2002.
[25]
S.-T. Park and D. Pennock, et al. Naïve filterbots for robust cold-start recommendations. In KDD, 2006.
[26]
J. Rennie and N. Srebro. Fast maximum margin matrix factorization for collaborative prediction. In ICML, 2005.
[27]
R. Salakhutdinov and A. Mnih. Bayesian probabilistic matrix factorization using markov chain monte carlo. In ICML, 2008.
[28]
R. Salakhutdinov and A. Mnih. Probabilistic matrix factorization. In NIPS, 2008.
[29]
A. I. Schein, L. K. Saul, and L. H. Ungar. A generalized linear model for principal component analysis of binary data. In AISTATS, 2003.
[30]
N. Srebro and T. Jaakkola. Weighted low-rank approximations. In ICML, 2003.
[31]
N. Srebro, J. Rennie, and T. Jaakkola. Maximum margin matrix factorizations. In NIPS, 2005.
[32]
D. H. Stern, R. Herbrich, and T. Graepel. Matchbox: large scale online bayesian recommendations. In WWW, 2009.
[33]
R. Tibshirani. Regression shrinkage and selection via the lasso. J. of the Royal Stat. Soc. B, 1996.
[34]
Y. Zhang and J. Koren. Efficient bayesian hierarchical user modeling for recommendation system. In SIGIR, 2007.

Cited By

View all
  • (2024)Leveraging Deep Collaborative Filtering for Advanced Recommender SystemsDigital Technologies and Applications10.1007/978-3-031-68650-4_7(62-71)Online publication date: 17-Aug-2024
  • (2023)Integrating metadata into deep autoencoder for handling prediction task of collaborative recommender systemMultimedia Tools and Applications10.1007/s11042-023-17029-783:14(42125-42147)Online publication date: 16-Oct-2023
  • (2021)Research Problems in Recommender systemsJournal of Physics: Conference Series10.1088/1742-6596/1717/1/0120021717(012002)Online publication date: 10-Jan-2021
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
RecSys '11: Proceedings of the fifth ACM conference on Recommender systems
October 2011
414 pages
ISBN:9781450306836
DOI:10.1145/2043932
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

In-Cooperation

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 23 October 2011

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. latent factor
  2. matrix factorization
  3. recommender systems
  4. regression priors
  5. tree models

Qualifiers

  • Research-article

Conference

RecSys '11
Sponsor:
RecSys '11: Fifth ACM Conference on Recommender Systems
October 23 - 27, 2011
Illinois, Chicago, USA

Acceptance Rates

Overall Acceptance Rate 254 of 1,295 submissions, 20%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)12
  • Downloads (Last 6 weeks)1
Reflects downloads up to 01 Mar 2025

Other Metrics

Citations

Cited By

View all
  • (2024)Leveraging Deep Collaborative Filtering for Advanced Recommender SystemsDigital Technologies and Applications10.1007/978-3-031-68650-4_7(62-71)Online publication date: 17-Aug-2024
  • (2023)Integrating metadata into deep autoencoder for handling prediction task of collaborative recommender systemMultimedia Tools and Applications10.1007/s11042-023-17029-783:14(42125-42147)Online publication date: 16-Oct-2023
  • (2021)Research Problems in Recommender systemsJournal of Physics: Conference Series10.1088/1742-6596/1717/1/0120021717(012002)Online publication date: 10-Jan-2021
  • (2021)Improving graph neural network for session-based recommendation system via non-sequential interactionsNeurocomputing10.1016/j.neucom.2021.10.034468:C(111-122)Online publication date: 30-Dec-2021
  • (2020)Local Variational Feature-Based Similarity Models for Recommending Top-N New ItemsACM Transactions on Information Systems10.1145/337215438:2(1-33)Online publication date: 11-Feb-2020
  • (2020)Item Cold-Start Recommendation with Personalized Feature SelectionJournal of Computer Science and Technology10.1007/s11390-020-9864-z35:5(1217-1230)Online publication date: 30-Sep-2020
  • (2019)Latent Factor Models Fusing User & Item Attributes2019 IEEE Symposium Series on Computational Intelligence (SSCI)10.1109/SSCI44817.2019.9002724(3201-3206)Online publication date: Dec-2019
  • (2019)Learning to Select User-Specific Features for Top-N Recommendation of New Items2019 IEEE 35th International Conference on Data Engineering Workshops (ICDEW)10.1109/ICDEW.2019.00-19(141-147)Online publication date: Apr-2019
  • (2019)Movie genomeUser Modeling and User-Adapted Interaction10.1007/s11257-019-09221-y29:2(291-343)Online publication date: 1-Apr-2019
  • (2018)GeoMF++ACM Transactions on Information Systems10.1145/318216636:3(1-29)Online publication date: 23-Mar-2018
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media