skip to main content
10.1145/1871437.1871707acmconferencesArticle/Chapter ViewAbstractPublication PagescikmConference Proceedingsconference-collections
poster

Exploiting user interests for collaborative filtering: interests expansion via personalized ranking

Authors Info & Claims
Published:26 October 2010Publication History

ABSTRACT

In real applications, a given user buys or rates an item based on his/her interests. Learning to leverage this interest information is often critical for recommender systems. However, in existing recommender systems, the information about latent user interests are largely under-explored. To that end, in this paper, we propose an interest expansion strategy via personalized ranking based on the topic model, named iExpand, for building an interest-oriented collaborative filtering framework. The iExpand method introduces a three-layer, user-interest-item, representation scheme, which leads to more interpretable recommendation results and helps the understanding of the interactions among users, items, and user interests. Moreover, iExpand strategically deals with many issues, such as the overspecialization and the cold-start problems. Finally, we evaluate iExpand on benchmark data sets, and experimental results show that iExpand outperforms state-of-the-art methods.

References

  1. Movielens datasets. URL: http://www.grouplens.org/node/73#attachments, 2007.Google ScholarGoogle Scholar
  2. D. M. Blei, Y. N. Andrew, and I. J. Michael. Latent Dirichlet Allocation. Journal of Machine Learning Research, 3, pages 993--1022, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. F. Fouss, A. Pirotte, J.-M. Renders, and M. Saerens. Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation. IEEE Trans. Knowl. Data Eng., 19(3), pages 355--369, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. S. Funk. Netflix update: Try this at home. URL: http://sifter.org/ simon/journal/20061211.html, 2006.Google ScholarGoogle Scholar
  5. M. Gori, and A. Pucci. A random-walk based scoring algorithm applied to recommender engines. In WebKDD'06, pages 127--146, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. T. L. Griffiths and M. Steyvers. Finding scientific topics. In PNAS'04 vol. 101, pages 5228--5235. 2004.Google ScholarGoogle ScholarCross RefCross Ref
  7. G. Jeh, and J. Widom. Scaling Personalized Web Search. In WWW'03, pages 271--279, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. R. Paul, I. Neophytos, S. Mitesh, B. Peter and R. John. GroupLens: an open architecture for collaborative filtering of netnews. In CSCW'94, pages 175--186, 1994. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. H. M. Wallach, I. Murray, R. Salakhutdinov and D. M. Mimno Evaluation methods for topic models. In ICML'09, pages 1105--1112, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. H. M. Wallach. Structured topic models for language. PhD thesis, University of Cambridge, 2008.Google ScholarGoogle Scholar
  11. H. Yildirim and M. S. Krishnamoorthy. A random walk method for alleviating the sparsity problem in collaborative filtering. In RecSys'08, pages 131--138, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. C. Ziegler, S. M. McNee, J. A. Konstan, and G. Lausen. Improving recommendation lists through topic diversification. In WWW'05, pages 22--32, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Exploiting user interests for collaborative filtering: interests expansion via personalized ranking

      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 '10: Proceedings of the 19th ACM international conference on Information and knowledge management
        October 2010
        2036 pages
        ISBN:9781450300995
        DOI:10.1145/1871437

        Copyright © 2010 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: 26 October 2010

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • poster

        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