Bin Li
Qiang Yang
ABSTRACT
Cross-domain collaborative filtering solves the sparsity problem by transferring rating knowledge across multiple domains. In this paper, we propose a rating-matrix generative model (RMGM) for effective cross-domain collaborative filtering. We first show that the relatedness across multiple rating matrices can be established by finding a shared implicit cluster-level rating matrix, which is next extended to a cluster-level rating model. Consequently, a rating matrix of any related task can be viewed as drawing a set of users and items from a user-item joint mixture model as well as drawing the corresponding ratings from the cluster-level rating model. The combination of these two models gives the RMGM, which can be used to fill the missing ratings for both existing and new users. A major advantage of RMGM is that it can share the knowledge by pooling the rating data from multiple tasks even when the users and items of these tasks do not overlap. We evaluate the RMGM empirically on three real-world collaborative filtering data sets to show that RMGM can outperform the individual models trained separately.
- Argyriou, A., Evgeniou, T., & Pontil, M. (2007). Multi-task feature learning. Advances in Neural Information Processing Systems 19 (pp. 41--48).Google Scholar
- Baxter, J. (2000). A model of inductive bias learning. J. of Artificial Intelligence Research, 12, 149--198. Google ScholarDigital Library
- Caruana, R. A. (1997). Multitask learning. Machine Learning, 28, 41--75. Google ScholarDigital Library
- Coyle, M., & Smyth, B. (2008). Web search shared: Social aspects of a collaborative, community-based search network. Proc. of the Fifth Int'l Conf. on Adaptive Hypermedia and Adaptive Web-Based Systems (pp. 103--112). Google ScholarDigital Library
- Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977). Maximum likelihood from incomplete data via the EM algorithm. J. of the Royal Statistical Society, B39, 1--38.Google Scholar
- Ding, C., Li, T., Peng, W., & Park, H. (2006). Orthogonal nonnegative matrix tri-factorizations for clustering. Proc. of the 12th ACM SIGKDD Int'l Conf. (pp. 126--135). Google ScholarDigital Library
- George, T., & Merugu, S. (2005). A scalable collaborative filtering framework based on co-clustering. Proc. of the Fifth IEEE Int'l Conf. on Data Mining (pp. 625--628). Google ScholarDigital Library
- Hofmann, T., & Puzicha, J. (1998). Statistical models for co-occurrence data (Technical Report AIM-1625). Artifical Intelligence Laboratory, MIT. Google ScholarDigital Library
- Hofmann, T., & Puzicha, J. (1999). Latent class models for collaborative filtering. Proc. of the 16th Int'l Joint Conf. on Artificial Intelligence (pp. 688--693). Google ScholarDigital Library
- Jebara, T. (2004). Multi-task feature and kernel selection for SVMs. Proc. of the 21st Int'l Conf. on Machine Learning (pp. 329--336). Google ScholarDigital Library
- Pennock, D. M., Horvitz, E., Lawrence, S., & Giles, C. L. (2000). Collaborative filtering by personality diagnosis: A hybrid memory- and model-based approach. Proc. of the 16th Conf. on Uncertainty in Artificial Intelligence (pp. 473--480). Google ScholarDigital Library
- Raina, R., Battle, A., Lee, H., Packer, B., & Ng, A. Y. (2007). Self-taught learning: Transfer learning from unlabeled data. Proc. of the Int'l Conf. on Machine Learning (pp. 759--766). Google ScholarDigital Library
- Resnick, P., Iacovou, N., Suchak, M., Bergstrom, P., & Riedl, J. (1994). GroupLens: An open architecture for collaborative filtering of netnews. Proc. of the ACM Conf. on Computer Supported Cooperative Work (pp. 175--186). Google ScholarDigital Library
- Sarwar, B., Karypis, G., Konstan, J., & Riedl, J. (2001). Item-based collaborative filtering recommendation algorithms. Proc. of the 10th Int'l World Wide Web Conf. (pp. 285--295). Google ScholarDigital Library
- Si, L., & Jin, R. (2003). Flexible mixture model for collaborative filtering. Proc. of the 20th Int'l Conf. on Machine Learning (pp. 704--711).Google Scholar
- Srebro, N., & Jaakkola, T. (2003). Weighted low-rank approximations. Proc. of the 20th Int'l Conf. on Machine Learning (pp. 720--727).Google Scholar
Index Terms
- Transfer learning for collaborative filtering via a rating-matrix generative model
Recommendations
Robust Transfer Learning for Cross-domain Collaborative Filtering Using Multiple Rating Patterns Approximation
WSDM '18: Proceedings of the Eleventh ACM International Conference on Web Search and Data MiningCollaborative filtering techniques are a common approach for building recommendations, and have been widely applied in real recommender systems. However, collaborative filtering usually suffers from limited performance due to the sparsity of user-item ...
Improvement of collaborative filtering using rating normalization
With the advent of the Internet, the types and amount of information one can access have increased dramatically. In today's overwhelming information environment, recommendation systems that quickly analyze large amounts of available information and help ...
Comments