skip to main content
10.1145/2396761.2396817acmconferencesArticle/Chapter ViewAbstractPublication PagescikmConference Proceedingsconference-collections
research-article

TALMUD: transfer learning for multiple domains

Authors Info & Claims
Published:29 October 2012Publication History

ABSTRACT

Most collaborative Recommender Systems (RS) operate in a single domain (such as movies, books, etc.) and are capable of providing recommendations based on historical usage data which is collected in the specific domain only. Cross-domain recommenders address the sparsity problem by using Machine Learning (ML) techniques to transfer knowledge from a dense domain into a sparse target domain. In this paper we propose a transfer learning technique that extracts knowledge from multiple domains containing rich data (e.g., movies and music) and generates recommendations for a sparse target domain (e.g., games). Our method learns the relatedness between the different source domains and the target domain, without requiring overlapping users between domains. The model integrates the appropriate amount of knowledge from each domain in order to enrich the target domain data. Experiments with several datasets reveal that, using multiple sources and the relatedness between domains improves accuracy of results.

References

  1. S. Berkovsky, T. Kuflik, and F. Ricci. Cross-domain mediation in collaborative filtering. User Modeling 2007, pages 355--359, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. J. Breese, D. Heckerman, C. Kadie, et al. Empirical analysis of predictive algorithms for collaborative filtering. In Proceedings of the 14th conference on Uncertainty in Artificial Intelligence, pages 43--52, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. B. Cao, N. Liu, and Q. Yang. Transfer learning for collective link prediction in multiple heterogeneous domains. In Proceedings of the 27th International Conference on Machine Learning, Haifa, Israel. Citeseer, 2010.Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. W. Dai, G. Xue, Q. Yang, and Y. Yu. Co-clustering based classification for out-of-domain documents. In Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 210--219. ACM, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. C. Desrosiers and G. Karypis. A comprehensive survey of neighborhood-based recommendation methods. Recommender Systems Handbook, pages 107--144, 2011.Google ScholarGoogle ScholarCross RefCross Ref
  6. T. Dietterich. Overfitting and undercomputing in machine learning. ACM Computing Surveys, 27(3):326--327, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. C. Ding, T. Li, W. Peng, and H. Park. Orthogonal nonnegative matrix t-factorizations for clustering. In Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 126--135. ACM, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. L. Getoor and C. Diehl. Link mining: a survey. ACM SIGKDD Explorations Newsletter, 7(2):3--12, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. T. Hofmann and J. Puzicha. Latent class models for collaborative filtering. In International Joint Conference on Artificial Intelligence, volume 16, pages 688--693. LAWRENCE ERLBAUM ASSOCIATES LTD, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. H. Kiers. Setting up alternating least squares and iterative majorization algorithms for solving various matrix optimization problems. Computational statistics & data analysis, 41(1):157--170, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. R. Kohavi and D. Sommerfield. Feature subset selection using the wrapper method: Overfitting and dynamic search space topology. In Proceedings of the First International Conference on Knowledge Discovery and Data Mining, pages 192 U-197, 1995.Google ScholarGoogle Scholar
  12. Y. Koren and R. Bell. Advances in collaborative filtering. Recommender Systems Handbook, pages 145--186, 2011.Google ScholarGoogle ScholarCross RefCross Ref
  13. B. Li. Cross-domain collaborative filtering: A brief survey. In 2011 23rd IEEE International Conference on Tools with Artificial Intelligence, pages 1085--1086. IEEE, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. B. Li, Q. Yang, and X. Xue. Can movies and books collaborate? cross-domain collaborative filtering for sparsity reduction. In Proceedings of the 21st international jont conference on Artificial intelligence, pages 2052--2057. Morgan Kaufmann Publishers Inc., 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. B. Li, Q. Yang, and X. Xue. Transfer learning for collaborative filtering via a rating-matrix generative model. In Proceedings of the 26th Annual International Conference on Machine Learning, pages 617--624. ACM, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. S. Pan and Q. Yang. A survey on transfer learning. Knowledge and Data Engineering, IEEE Transactions on, 22(10):1345--1359, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. W. Pan, E. Xiang, N. Liu, and Q. Yang. Transfer learning in collaborative filtering for sparsity reduction. In Proceedings of the 24rd AAAI Conference on Artificial Intelligence, 2010.Google ScholarGoogle Scholar
  18. G. Shani and A. Gunawardana. Evaluating recommendation systems. Recommender Systems Handbook, pages 257--297, 2011.Google ScholarGoogle ScholarCross RefCross Ref
  19. G. Xue, W. Dai, Q. Yang, and Y. Yu. Topic-bridged plsa for cross-domain text classification. In Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval, pages 627--634. ACM, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Y. Zhang, B. Cao, and D. Yeung. Multi-domain collaborative filtering. In Proceedings of the 26th Conference on Uncertainty in Artificial Intelligence (UAI), Catalina Island, California, USA, 2010.Google ScholarGoogle Scholar

Index Terms

  1. TALMUD: transfer learning for multiple domains

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • Published in

          cover image ACM Conferences
          CIKM '12: Proceedings of the 21st ACM international conference on Information and knowledge management
          October 2012
          2840 pages
          ISBN:9781450311564
          DOI:10.1145/2396761

          Copyright © 2012 ACM

          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]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 29 October 2012

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • research-article

          Acceptance Rates

          Overall Acceptance Rate1,861of8,427submissions,22%

          Upcoming Conference

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader