Regression-based latent factor models
The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
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.
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
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01600.x · Cited by 50,444
(2005) · Statistics for Biology and Health · doi:10.1007/0-387-27255-0_9 · Cited by 20,133
McCullagh, P., & Nelder, J. A. (1989) · doi:10.1007/978-1-4899-3242-6 · Cited by 16,836
Data Analysis Using Regression and Multilevel/Hierarchical Models
Gelman, A., & Hill, J. (2006) · doi:10.1017/cbo9780511790942 · Cited by 13,597
Gaussian Processes for Machine Learning
Rasmussen, C. E., & Williams, C. K. I. (2005) · doi:10.7551/mitpress/3206.001.0001 · Cited by 11,705
ALGORITHMS FOR NON-NEGATIVE MATRIX FACTORIZATION
Seung, D., & Lee, L.-W. (2001) · Cited by 4,753
Probabilistic Matrix Factorization
Mnih, A., & Salakhutdinov, R. (2007) · UCL Discovery (University College London) · Cited by 4,517
Maximum Likelihood from Incomplete Data via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1976) · Cited by 4,517
Probabilistic Latent Semantic Indexing
Hofmann, T. (2017) · ACM SIGIR Forum · doi:10.1145/3130348.3130370 · Cited by 3,988
Probabilistic latent semantic indexing
Hofmann, T. (1999) · Proceedings of the 22nd annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/312624.312649 · Cited by 3,976
Fab: content-based, collaborative recommendation
Balabanović, M., & Shoham, Y. (1997) · Communications of the ACM · doi:10.1145/245108.245124 · Cited by 2,934
An Algorithmic Framework for Performing Collaborative Filtering
Herlocker, J. L., Konstan, J. A., Borchers, A., & Riedl, J. (2017) · ACM SIGIR Forum · doi:10.1145/3130348.3130372 · Cited by 2,512
A View of the Em Algorithm that Justifies Incremental, Sparse, and other Variants
Neal, R. M., & Hinton, G. E. (1998) · Learning in Graphical Models · doi:10.1007/978-94-011-5014-9_12 · Cited by 2,187 · cited 2×
“To ensure convergence, it is sufficient to use any hill climbing method in the M-step that provides a new improved value of Θ; such variants are called generalized EM (GEM) [19].”
MethodAn algorithmic framework for performing collaborative filtering
Herlocker, J. L., Konstan, J. A., Borchers, A., & Riedl, J. (1999) · Proceedings of the 22nd annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/312624.312682 · Cited by 2,011
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
Bayesian probabilistic matrix factorization using Markov chain Monte Carlo
Salakhutdinov, R., & Mnih, A. (2008) · Proceedings of the 25th international conference on Machine learning - ICML '08 · doi:10.1145/1390156.1390267 · Cited by 1,413
A WEAKLY INFORMATIVE DEFAULT PRIOR DISTRIBUTION FOR LOGISTIC AND OTHER REGRESSION MODELS
Gelman, A., Jakulin, A., & Grazia, M. (2009) · Cited by 1,352
Probabilistic Matrix Factorization
Salakhutdinov, R., & Mnih, A. (2007) · Cited by 1,075
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
Combining Collaborative Filtering with Personal Agents for Better Recommendations
Good, N. S., Schafer, J. B., Konstan, J. A., Borchers, A., Sarwar, B. M., Herlocker, J., & Riedl, J. (1999) · Cited by 791
Combining Content-Based and Collaborative Filters in an Online Newspaper
Claypool, M. K., Gokhale, A., Miranda, T., Murnikov, P., Netes, D., & Sartin, M. M. (1999) · Cited by 775
Maximizing Generalized Linear Mixed Model Likelihoods With an Automated Monte Carlo EM Algorithm
Booth, J. G., & Hobert, J. P. (1999) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/1467-9868.00176 · Cited by 551
Modeling relationships at multiple scales to improve accuracy of large recommender systems
Bell, R., Koren, Y., & Volinsky, C. (2007) · Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1281192.1281206 · Cited by 368
A Generalized Maximum Entropy Approach to Bregman Co-clustering and Matrix Approximation
Banerjee, A., Dhillon, I. S., Ghosh, J., Merugu, S., Modha, D. S., & Lafferty, J. (2004) · Cited by 307
Efficient bayesian hierarchical user modeling for recommendation system
Zhang, Y., & Koren, J. (2007) · Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1277741.1277752 · Cited by 186
Naïve filterbots for robust cold-start recommendations
Park, S.-T., Pennock, D. M., Madani, O., Good, N., & DeCoste, D. (2006) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1150402.1150490 · Cited by 177
Spatio-temporal models for estimating click-through rate
Agarwal, D., Chen, B.-C., & Elango, P. (2009) · International World Wide Web Conference (WWW) · doi:10.1145/1526709.1526713 · Cited by 161
Self-citationOnline Models for Content Optimization
Agarwal, D., Chen, B.-C., Elango, P., Motgi, N., Park, S.-T., Ramakrishnan, R., Roy, S., & Zachariah, J. (2008) · neural information processing systems · Cited by 127
Self-citationHierarchical Bayes Models: A Practitioners GuidePreprint
Allenby, G. M., Rossi, P. E., & McCulloch, R. E. (2005) · SSRN Electronic Journal · doi:10.2139/ssrn.655541 · Cited by 94
Predictive discrete latent factor models for large scale dyadic data
Agarwal, D., & Merugu, S. (2007) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1281192.1281199 · Cited by 73
Self-citation
Cited by
Collaborative Deep Learning for Recommender Systems
Wang, H., Wang, N., & Yeung, D.-Y. (2015) · Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2783258.2783273 · Cited by 1,657
Collaborative topic modeling for recommending scientific articles
Wang, C., & Blei, D. M. (2011) · Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2020408.2020480 · Cited by 1,527
Factorization Machines with libFM
Rendle, S. (2012) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/2168752.2168771 · Cited by 1,337
DKN: Deep Knowledge-Aware Network for News Recommendation
Wang, H., Zhang, F., Xie, X., & Guo, M. (2018) · Proceedings of the 2018 World Wide Web Conference on World Wide Web - WWW '18 · doi:10.1145/3178876.3186175 · Cited by 1,034
Collaborative Denoising Auto-Encoders for Top-N Recommender Systems
Wu, Y., DuBois, C., Zheng, A. X., & Ester, M. (2016) · Proceedings of the Ninth ACM International Conference on Web Search and Data Mining · doi:10.1145/2835776.2835837 · Cited by 1,001
Metadata
- Authors
- Agarwal, D., & Chen, B.-C.
- Venue
- Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
- Publisher
- ACM
- Published
- 2009-06-28
- Pages
- 19-28
- OpenAlex
- W2054553473
- Cited by
- 514
- References
- 30
- FWCI
- 20.17
- 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.