skip to main content
10.1145/2487575.2487638acmconferencesArticle/Chapter ViewAbstractPublication PageskddConference Proceedingsconference-collections
poster

Making recommendations from multiple domains

Authors Info & Claims
Published:11 August 2013Publication History

ABSTRACT

Given the vast amount of information on the World Wide Web, recommender systems are increasingly being used to help filter irrelevant data and suggest information that would interest users. Traditional systems make recommendations based on a single domain e.g., movie or book domain. Recent work has examined the correlations in different domains and designed models that exploit user preferences on a source domain to predict user preferences on a target domain. However, these methods are based on matrix factorization and can only be applied to two-dimensional data. Transferring high dimensional data from one domain to another requires decomposing the high dimensional data to binary relations which results in information loss.

Furthermore, this decomposition creates a large number of matrices that need to be transferred and combining them in the target domain is non-trivial. Separately, researchers have looked into using social network information to improve recommendation. However, this social network information has not been explored in cross domain collaborative filtering. In this work, we propose a generalized cross domain collaborative filtering framework that integrates social network information seamlessly with cross domain data. This is achieved by utilizing tensor factorization with topic based social regularization. This framework is able to transfer high dimensional data without the need for decomposition by finding shared implicit cluster-level tensor from multiple domains. Extensive experiments conducted on real world datasets indicate that the proposed framework outperforms state-of-art algorithms for item recommendation, user recommendation and tag recommendation.

References

  1. W. Pan, N. N. Liu, E. W. Xiang, and Q. Yang, "Transfer learning to predict missing ratings via heterogeneous user feedbacks." in phIJCAI, 2011, pp. 2318--2323. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. B. Li, Q. Yang, and X. Xue, "Transfer learning for collaborative filtering via a rating-matrix generative model," in phICML, 2009, pp. 617--624. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Y. Shi, M. Larson, and A. Hanjalic, "Tags as bridges between domains: improving recommendation with tag-induced cross-domain collaborative filtering," in phUMAP, 2011, pp. 305--316. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. M. Jamali and M. Ester, "A transitivity aware matrix factorization model for recommendation in social networks." in phIJCAI, 2011, pp. 2644--2649. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. H. Ma, D. Zhou, C. Liu, M. R. Lyu, and I. King, "Recommender systems with social regularization," in phWSDM, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. L. D. Lathauwer, B. D. Moor, and J. Vandewalle, "A multilinear singular value decomposition," phSIAM J. Matrix Anal. Appl., vol. 21, pp. 1253--1278, March 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Y.-D. Kim and S. Choi, "Nonnegative tucker decomposition." in phCVPR.\hskip 1em plus 0.5em minus 0.4em\relax IEEE Computer Society, 2007, pp. 1 --8.Google ScholarGoogle Scholar
  8. D. D. Lee and H. S. Seung, "Algorithms for non-negative matrix factorization," in phNIPS, 2000, pp. 556--562.Google ScholarGoogle Scholar
  9. P. Resnick, N. Iacovou, M. Sushak, P. Bergstrom, and J. Riedl, "Grouplens: An open architecture for collaborative filtering of netnews," in phCSCWC, 1994, pp. 175--186. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. M. Deshpande and G. Karypis, "Item-based top-n recommendation algorithms," phACM Transactions on Information Systems, vol. 22, pp. 143--177, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. P. Symeonidis, A. Nanopoulos, and Y. Manolopoulos, "A unified framework for providing recommendations in social tagging systems based on ternary semantic analysis," phIEEE TKDE, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. S. Rendle, L. Balby Marinho, A. Nanopoulos, and L. Schmidt-Thieme, "Learning optimal ranking with tensor factorization for tag recommendation," in phKDD, 2009, pp. 727--736. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. C. Wei, W. Hsu, and M. L. Lee, "A unified framework for recommendations based on quaternary semantic analysis," in phSIGIR, 2011, pp. 1023--1032. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. C. Liu, H.-c. Yang, J. Fan, L.-W. He, and Y.-M. Wang, "Distributed nonnegative matrix factorization for web-scale dyadic data analysis on mapreduce," ser. WWW, 2010, pp. 681--690. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. G.-R. Xue, C. Lin, Q. Yang, W. Xi, H.-J. Zeng, Y. Yu, and Z. Chen, "Scalable collaborative filtering using cluster-based smoothing," in phSIGIR, 2005, pp. 114--121. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Y. Koren, "Factorization meets the neighborhood: a multifaceted collaborative filtering model," in phKDD, 2008, pp. 426--434. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. J. A. Golbeck, "Computing and applying trust in web-based social networks," Ph.D. dissertation, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. M. Jamali and M. Ester, "Trustwalker: a random walk model for combining trust-based and item-based recommendation," in phKDD, 2009, pp. 397--406. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Y. Shen and R. Jin, "Learning personalGoogle ScholarGoogle Scholar
  20. social latent factor model for social recommendation," in phKDD, 2012, pp. 1303--1311. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Making recommendations from 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
        KDD '13: Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
        August 2013
        1534 pages
        ISBN:9781450321747
        DOI:10.1145/2487575

        Copyright © 2013 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: 11 August 2013

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • poster

        Acceptance Rates

        KDD '13 Paper Acceptance Rate125of726submissions,17%Overall Acceptance Rate1,133of8,635submissions,13%

        Upcoming Conference

        KDD '24

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader