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

Localized factor models for multi-context recommendation

Published: 21 August 2011 Publication History

Abstract

Combining correlated information from multiple contexts can significantly improve predictive accuracy in recommender problems. Such information from multiple contexts is often available in the form of several incomplete matrices spanning a set of entities like users, items, features, and so on. Existing methods simultaneously factorize these matrices by sharing a single set of factors for entities across all contexts. We show that such a strategy may introduce significant bias in estimates and propose a new model that ameliorates this issue by positing local, context-specific factors for entities. To avoid over-fitting in contexts with sparse data, the local factors are connected through a shared global model. This sharing of parameters allows information to flow across contexts through multivariate regressions among local factors, instead of enforcing exactly the same factors for an entity, everywhere. Model fitting is done in an EM framework, we show that the E-step can be fitted through a fast multi-resolution Kalman filter algorithm that ensures scalability. Experiments on benchmark and real-world Yahoo! datasets clearly illustrate the usefulness of our approach. Our model significantly improves predictive accuracy, especially in cold-start scenarios.

References

[1]
D. Agarwal and B.-C. Chen. Regression-based latent factor models. In KDD, 2009.
[2]
D. Agarwal and B.-C. Chen, et al. Online models for content optimization. In NIPS, 2008.
[3]
R. Ando and T. Zhang. A high-performance semi-supervised learning method for text chunking. In ACL, 2005.
[4]
A. Argyriou, T. Evgeniou, and M. Pontil. Multi-task feature learning. In NIPS, 2007.
[5]
A. Argyriou, C. Micchelli, M. Pontil, and Y. Ying. A spectral regularization framework for multi-task structure learning. NIPS, 2008.
[6]
S. Bickel, M. Brückner, and T. Scheffer. Discriminative learning for differing training and test distributions. In ICML, 2007.
[7]
D. Blackwell. Conditional expectation and unbiased sequential estimation. Annals of Math. Stat., 1947.
[8]
J. Blitzer, K. Crammer, A. Kulesza, F. Pereira, and J. Wortman. Learning bounds for domain adaptation. NIPS, 2008.
[9]
J. Blitzer, R. McDonald, and F. Pereira. Domain adaptation with structural correspondence learning. In EMNLP, 2006.
[10]
A. Blum and T. Mitchell. Combining labeled and unlabeled data with co-training. In COLT, 1998.
[11]
E. Bonilla, K. Chai, and C. Williams. Multi-task gaussian process prediction. NIPS, 2007.
[12]
R. Carroll, D. Ruppert, L. Stefanski, and C. Crainiceanu. Measurement Error in Nonlinear Models. Chapman and Hall, 2008.
[13]
K. C. Chou, A. S. Willsky, and R. Nikoukhah. Multiscale systems, Kalman filters, and Ricatti equations. IEEE Trans. on Automatic Control, 1994.
[14]
W. Dai, G. Xue, Q. Yang, and Y. Yu. Co-clustering based classification for out-of-domain documents. In KDD, 2007.
[15]
W. Dai, Q. Yang, G. Xue, and Y. Yu. Boosting for transfer learning. In ICML, 2007.
[16]
H. Daumé. Cross-task knowledge-constrained self training. In EMNLP, 2008.
[17]
H. Daume III and D. Marcu. Domain adaptation for statistical classifiers. Journal of Artificial Intelligence Research, 2006.
[18]
J. Davis and P. Domingos. Deep transfer via second-order markov logic. In AAAI Workshop on Transfer Learning for Complex Tasks, 2008.
[19]
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.
[20]
T. Evgeniou and M. Pontil. Regularized multi-task learning. In KDD, 2004.
[21]
J. L. Herlocker, J. A. Konstan, A. Borchers, and J. Riedl. An algorithmic framework for performing collaborative filtering. In SIGIR, 1999.
[22]
H. Huang and N. Cressie. Fast spatial prediction of global processes from satellite data. SIAM J. on Scientific Computing, 2000.
[23]
H. Huang and N. Cressie. Multiscale graphical modeling in space: Applications to command and control. In Spatial Statistics Workshop, 2000.
[24]
J. Huang, A. Smola, A. Gretton, K. Borgwardt, and B. Scholkopf. Correcting sample selection bias by unlabeled data. NIPS, 2007.
[25]
T. Jaakkola and M. Jordan. Bayesian logistic regression: a variational approach. Statistics and Computing, 2000.
[26]
J. Jiang and C. Zhai. Instance weighting for domain adaptation in NLP. In ACL, 2007.
[27]
H. Kaji and Y. Morimoto. Unsupervised word sense disambiguation using bilingual comparable corpora. In COLIN, 2002.
[28]
Y. Koren, R. Bell, and C. Volinsky. Matrix factorization techniques for recommender systems. Computer, 2009.
[29]
N. Kushmerick. Learning to remove internet advertisements. In Int. Conf. Autonomous Agents, 1999.
[30]
N. Lawrence and J. Platt. Learning to learn with the informative vector machine. In ICML, 2004.
[31]
S. Lee, V. Chatalbashev, D. Vickrey, and D. Koller. Learning a meta-level prior for feature relevance from multiple related tasks. In ICML, 2007.
[32]
X. Liao, Y. Xue, and L. Carin. Logistic regression with an auxiliary data source. In ICML, 2005.
[33]
X. Ling, W. Dai, G.-R. Xue, Q. Yang, and Y. Yu. Spectral domain-transfer learning. In KDD, 2008.
[34]
P. Massa and P. Avesani. Trust metrics in recommender systems. In Computing with Social Trust, 2009.
[35]
L. Mihalkova, T. Huynh, and R. Mooney. Mapping and revising markov logic networks for transfer learning. In AAAI, 2007.
[36]
L. Mihalkova and R. Mooney. Transfer learning by mapping with minimal target data. In AAAI Workshop on Transfer Learning for Complex Tasks, 2008.
[37]
S. J. Pan and Q. Yang. A survey on transfer learning. Technical Report HKUST-CS08-08, Hong Kong University of Science and Technology, 2008.
[38]
R. Raina, A. Battle, H. Lee, B. Packer, and A. Ng. Self-taught learning: Transfer learning from unlabeled data. In ICML, 2007.
[39]
A. Schwaighofer, V. Tresp, and K. Yu. Learning Gaussian process kernels via hierarchical Bayes. NIPS, 2005.
[40]
A. P. Singh and G. J. Gordon. Relational learning via collective matrix factorization. In KDD, 2008.
[41]
D. H. Stern, R. Herbrich, and T. Graepel. Matchbox: large scale online bayesian recommendations. In WWW, 2009.
[42]
X. Su and T. M. Khoshgoftaar. A survey of collaborative filtering techniques. Adv. in Artif. Intell., 2009.
[43]
M. Sugiyama, S. Nakajima, H. Kashima, P. von Bunau, and M. Kawanabe. Direct importance estimation with model selection and its application to covariate shift adaptation. NIPS, 2008.
[44]
K. Yu and V. Tresp. Learning to learn and collaborative filtering. In In NIPS Workshop on Inductive Transfer: 10 Years Later, 2005.
[45]
S. Yu, K. Yu, V. Tresp, and H.-P. Kriegel. Collaborative ordinal regression. In ICML, 2006.

Cited By

View all
  • (2024)Privacy-preserving Cross-domain Recommendation with Federated Graph LearningACM Transactions on Information Systems10.1145/365344842:5(1-29)Online publication date: 13-May-2024
  • (2024)Identifiability of Cross-Domain Recommendation via Causal Subspace DisentanglementProceedings of the 47th International ACM SIGIR Conference on Research and Development in Information Retrieval10.1145/3626772.3657758(2091-2101)Online publication date: 10-Jul-2024
  • (2024)Cross domain recommendation using dual inductive transfer learningMultimedia Tools and Applications10.1007/s11042-024-19967-2Online publication date: 8-Aug-2024
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
KDD '11: Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
August 2011
1446 pages
ISBN:9781450308137
DOI:10.1145/2020408
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: 21 August 2011

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. data fusion
  2. epinions
  3. kalman filter
  4. meta-analysis
  5. recommender systems

Qualifiers

  • Research-article

Conference

KDD '11
Sponsor:

Acceptance Rates

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

Upcoming Conference

KDD '25

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

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

Other Metrics

Citations

Cited By

View all
  • (2024)Privacy-preserving Cross-domain Recommendation with Federated Graph LearningACM Transactions on Information Systems10.1145/365344842:5(1-29)Online publication date: 13-May-2024
  • (2024)Identifiability of Cross-Domain Recommendation via Causal Subspace DisentanglementProceedings of the 47th International ACM SIGIR Conference on Research and Development in Information Retrieval10.1145/3626772.3657758(2091-2101)Online publication date: 10-Jul-2024
  • (2024)Cross domain recommendation using dual inductive transfer learningMultimedia Tools and Applications10.1007/s11042-024-19967-2Online publication date: 8-Aug-2024
  • (2023)Disentangled Representations Learning for Multi-target Cross-domain RecommendationACM Transactions on Information Systems10.1145/357283541:4(1-27)Online publication date: 23-Mar-2023
  • (2023)AutoMF: A hybrid matrix factorization model with deep learning to select anti-viral drugs for Covid-19Journal of Computational Science10.1016/j.jocs.2023.10215474(102154)Online publication date: Dec-2023
  • (2023)Cross-platform sequential recommendation with sharing item-level relevance dataInformation Sciences10.1016/j.ins.2022.11.112621(265-286)Online publication date: Apr-2023
  • (2022)An Adaptive Graph Pre-training Framework for Localized Collaborative FilteringACM Transactions on Information Systems10.1145/355537241:2(1-27)Online publication date: 21-Dec-2022
  • (2022)A Survey on Cross-domain Recommendation: Taxonomies, Methods, and Future DirectionsACM Transactions on Information Systems10.1145/354845541:2(1-39)Online publication date: 21-Dec-2022
  • (2022)Are Neural Ranking Models Robust?ACM Transactions on Information Systems10.1145/353492841:2(1-36)Online publication date: 21-Dec-2022
  • (2022)Cross-Domain Explicit–Implicit-Mixed Collaborative Filtering Neural NetworkIEEE Transactions on Systems, Man, and Cybernetics: Systems10.1109/TSMC.2021.312926152:11(6983-6997)Online publication date: Nov-2022
  • 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