Combining labeled and unlabeled data with co-training
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
Learning to remove Internet advertisements
Proceedings of the third annual conference on Autonomous Agents
An algorithmic framework for performing collaborative filtering
Proceedings of the 22nd annual international ACM SIGIR conference on Research and development in information retrieval
Regularized multi--task learning
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Learning to learn with the informative vector machine
ICML '04 Proceedings of the twenty-first international conference on Machine learning
Unsupervised word sense disambiguation using bilingual comparable corpora
COLING '02 Proceedings of the 19th international conference on Computational linguistics - Volume 1
Logistic regression with an auxiliary data source
ICML '05 Proceedings of the 22nd international conference on Machine learning
Collaborative ordinal regression
ICML '06 Proceedings of the 23rd international conference on Machine learning
A high-performance semi-supervised learning method for text chunking
ACL '05 Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics
Discriminative learning for differing training and test distributions
Proceedings of the 24th international conference on Machine learning
Boosting for transfer learning
Proceedings of the 24th international conference on Machine learning
Learning a meta-level prior for feature relevance from multiple related tasks
Proceedings of the 24th international conference on Machine learning
Self-taught learning: transfer learning from unlabeled data
Proceedings of the 24th international conference on Machine learning
Co-clustering based classification for out-of-domain documents
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Spectral domain-transfer learning
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Relational learning via collective matrix factorization
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Matchbox: large scale online bayesian recommendations
Proceedings of the 18th international conference on World wide web
Regression-based latent factor models
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Domain adaptation with structural correspondence learning
EMNLP '06 Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing
Cross-task knowledge-constrained self training
EMNLP '08 Proceedings of the Conference on Empirical Methods in Natural Language Processing
Mapping and revising Markov logic networks for transfer learning
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Domain adaptation for statistical classifiers
Journal of Artificial Intelligence Research
A survey of collaborative filtering techniques
Advances in Artificial Intelligence
Accelerated singular value thresholding for matrix completion
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
TFMAP: optimizing MAP for top-n context-aware recommendation
SIGIR '12 Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval
Sparse linear methods with side information for top-n recommendations
Proceedings of the sixth ACM conference on Recommender systems
Co-factorization machines: modeling user interests and predicting individual decisions in Twitter
Proceedings of the sixth ACM international conference on Web search and data mining
Bayesian Canonical correlation analysis
The Journal of Machine Learning Research
Hi-index | 0.00 |
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.