Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/1557019.1557029acmconferencesArticle/Chapter ViewAbstractPublication PageskddConference Proceedingsconference-collections
research-article

Regression-based latent factor models

Published: 28 June 2009 Publication History

Abstract

We propose a novel latent factor model to accurately predict response for large scale dyadic data in the presence of features. Our approach is based on a model that predicts response as a multiplicative function of row and column latent factors that are estimated through separate regressions on known row and column features. In fact, our model provides a single unified framework to address both cold and warm start scenarios that are commonplace in practical applications like recommender systems, online advertising, web search, etc. We provide scalable and accurate model fitting methods based on Iterated Conditional Mode and Monte Carlo EM algorithms. We show our model induces a stochastic process on the dyadic space with kernel (covariance) given by a polynomial function of features. Methods that generalize our procedure to estimate factors in an online fashion for dynamic applications are also considered. Our method is illustrated on benchmark datasets and a novel content recommendation application that arises in the context of Yahoo! Front Page. We report significant improvements over several commonly used methods on all datasets.

Supplementary Material

JPG File (p19-agarwal.jpg)
MP4 File (p19-agarwal.mp4)

References

[1]
KDD cup and workshop. 2007.
[2]
D. Agarwal, B.-C. Chen, and P. Elango. Spatio-temporal models for estimating click rates. In WWW, 2009.
[3]
D. Agarwal and B.-C. Chen, et al. Online models for content optimization. In NIPS, 2008.
[4]
D. Agarwal and S. Merugu. Predictive discrete latent factor models. In KDD, 2007.
[5]
G. Allenby, P. Rossi, and R. McCulloch. Hierarchical bayes models: A practitioner's guide. http://ssrn.com/abstract=655541, 2005.
[6]
M. Balabanovic and Y. Shoham. Fab: content-based, collaborative recommendation. Comm. of the ACM, 1997.
[7]
A. Banerjee and I. Dhillon, et al. A generalized maximum entropy approach to Bregman co-clustering and matrix approximation. J. of Machine Learning Research, 2007.
[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]
M. Claypool and A. Gokhale, et al. Combining content-based and collaborative filters in an online newspaper. In Recommender Systems Workshop, 1999.
[11]
A. P. Dempster, N. M. Laird, and D. B. Rubin. Maximum likelihood from incomplete data via the EM algorithm. J. of the Royal Statistical Society, Series B, 1977.
[12]
A. Gelman and J. Hill. Data Analysis using Regression and Multilevel/Hierarchical Models. Cambridge, 2006.
[13]
A. Gelman and A. Jakulin, et al. A weakly informative default prior distribution for logistic and other regression models. Annals of Applied Statistics, 2008.
[14]
N. Good and J. B. Schafer, et al. Combining collaborative filtering with personal agents for better recommendations. In AAAI, 1999.
[15]
J. L. Herlocker and J. A. Konstan, et al. An algorithmic framework for performing collaborative filtering. In SIGIR, 1999.
[16]
T. Hofmann. Probabilistic latent semantic indexing. In SIGIR, 1999.
[17]
D. L. Lee and S. Seung. Algorithms for non-negative matrix factorization. In NIPS, 2001.
[18]
P. McCullagh and J. A. Nelder. Generalized Linear Models. Chapman&Hall/CRC, 1989.
[19]
R. Neal and G. Hinton. A view of the EM algorithm that justifies incremental, sparse, and other variants. In Learning in Graphical Models, 1998.
[20]
S.-T. Park and D. Pennock, et al. Naive filterbots for robust cold--start recommendations. In KDD, 2006.
[21]
C. Rasmussen and C. Williams. Gaussian Processes for Machine Learning. MIT Press, 2006.
[22]
J. Rennie and N. Srebro. Fast maximum margin matrix factorization for collaborative prediction. In ICML, 2005.
[23]
R. Salakhutdinov and A. Mnih. Bayesian probabilistic matrix factorization using markov chain monte carlo. In ICML'08.
[24]
R. Salakhutdinov and A. Mnih. Probabilistic matrix factorization. In NIPS, 2008.
[25]
A. I. Schein and R. Popescul, et al. Methods and metrics for cold-start recommendations. In SIGIR, 2002.
[26]
A. I. Schein, L. K. Saul, and L. H. Ungar. A generalized linear model for principal component analysis of binary data. In AISTATS, 2003.
[27]
R. Smith. Bayesian and Frequentist Approaches to Parametric Predictive Inference. Oxford University, 1999.
[28]
Y. Zhang and J. Koren. Efficient bayesian hierarchical user modeling for recommendation system. In SIGIR, 2007.

Cited By

View all
  • (2024)Optimizing Probabilistic Box Embeddings with Distance Measures2024 IEEE 40th International Conference on Data Engineering (ICDE)10.1109/ICDE60146.2024.00106(5088-5100)Online publication date: 13-May-2024
  • (2024)Accelerated Structured Matrix FactorizationJournal of Computational and Graphical Statistics10.1080/10618600.2023.230107233:3(917-927)Online publication date: 7-Feb-2024
  • (2024)Deep learning with the generative models for recommender systems: A surveyComputer Science Review10.1016/j.cosrev.2024.10064653(100646)Online publication date: Aug-2024
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
KDD '09: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
June 2009
1426 pages
ISBN:9781605584959
DOI:10.1145/1557019
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

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 28 June 2009

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. dyadic data
  2. interaction
  3. latent factor
  4. predictive
  5. recommender systems
  6. sparse

Qualifiers

  • Research-article

Conference

KDD09

Acceptance Rates

Overall Acceptance Rate 1,133 of 8,635 submissions, 13%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)136
  • Downloads (Last 6 weeks)21
Reflects downloads up to 26 Sep 2024

Other Metrics

Citations

Cited By

View all
  • (2024)Optimizing Probabilistic Box Embeddings with Distance Measures2024 IEEE 40th International Conference on Data Engineering (ICDE)10.1109/ICDE60146.2024.00106(5088-5100)Online publication date: 13-May-2024
  • (2024)Accelerated Structured Matrix FactorizationJournal of Computational and Graphical Statistics10.1080/10618600.2023.230107233:3(917-927)Online publication date: 7-Feb-2024
  • (2024)Deep learning with the generative models for recommender systems: A surveyComputer Science Review10.1016/j.cosrev.2024.10064653(100646)Online publication date: Aug-2024
  • (2023)Adaptive principal component regression with applications to panel dataProceedings of the 37th International Conference on Neural Information Processing Systems10.5555/3666122.3669494(77104-77118)Online publication date: 10-Dec-2023
  • (2023)Lending interaction wings to recommender systems with conversational agentsProceedings of the 37th International Conference on Neural Information Processing Systems10.5555/3666122.3667335(27951-27979)Online publication date: 10-Dec-2023
  • (2023)Towards Recommender Systems Integrating Contextual Information from Multiple Domains through Tensor FactorizationArtificial Intelligence and Data Science in Recommendation System: Current Trends, Technologies and Applications10.2174/9789815136746123010007(72-109)Online publication date: 14-Aug-2023
  • (2023)Graph Disentangled Collaborative Filtering based on Multi-order Similarity Constraint2023 IEEE 10th International Conference on Data Science and Advanced Analytics (DSAA)10.1109/DSAA60987.2023.10302614(1-10)Online publication date: 9-Oct-2023
  • (2023)An Improved Dual-Channel Deep Q-Network Model for Tourism RecommendationBig Data10.1089/big.2021.035311:4(268-281)Online publication date: 1-Aug-2023
  • (2023)Click prediction boosting via Bayesian hyperparameter optimization-based ensemble learning pipelinesIntelligent Systems with Applications10.1016/j.iswa.2023.20018517(200185)Online publication date: Feb-2023
  • (2023)Modeling users’ heterogeneous taste with diversified attentive user profilesUser Modeling and User-Adapted Interaction10.1007/s11257-023-09376-934:2(375-405)Online publication date: 1-Aug-2023
  • Show More Cited By

View Options

Get Access

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media