skip to main content
10.1145/1835804.1835896acmconferencesArticle/Chapter ViewAbstractPublication PageskddConference Proceedingsconference-collections
research-article

Temporal recommendation on graphs via long- and short-term preference fusion

Published:25 July 2010Publication History

ABSTRACT

Accurately capturing user preferences over time is a great practical challenge in recommender systems. Simple correlation over time is typically not meaningful, since users change their preferences due to different external events. User behavior can often be determined by individual's long-term and short-term preferences. How to represent users' long-term and short-term preferences? How to leverage them for temporal recommendation? To address these challenges, we propose Session-based Temporal Graph (STG) which simultaneously models users' long-term and short-term preferences over time. Based on the STG model framework, we propose a novel recommendation algorithm Injected Preference Fusion (IPF) and extend the personalized Random Walk for temporal recommendation. Finally, we evaluate the effectiveness of our method using two real datasets on citations and social bookmarking, in which our proposed method IPF gives 15%-34% improvement over the previous state-of-the-art.

Skip Supplemental Material Section

Supplemental Material

kdd2010_yuan_trgl_01.mov

References

  1. S. Baluja, R. Seth, D. Sivakumar, Y. Jing, J. Yagnik, S. Kumar, D. Ravichandran, and M. Aly. Video suggestion and discovery for youtube: taking random walks through the view graph. In WWW '08, pages 895--904, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Y. Ding and X. Li. Time weight collaborative filtering. In CIKM '05, pages 485--492, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. M. Gori and A. Pucci. Research paper recommender systems: A random-walk based approach. In WI '06, pages 778--781, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. T. H. Haveliwala. Topic-sensitive pagerank. In WWW '02, pages 517--526, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Y. Hu, Y. Koren, and C. Volinsky. Collaborative filtering for implicit feedback datasets. In ICDM '08, pages 263--272, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Z. Huang, W. Chung, and H. Chen. A graph model for e-commerce recommender systems. J. Am. Soc. Inf. Sci. Technol., 55(3):259--274, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. M. Jamali and M. Ester. Trustwalker: a random walk model for combining trust-based and item-based recommendation. In KDD '09, pages 397--406, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. R. Jaschke, L. Marinho, A. Hotho, L. Schmidt-Thieme, and G. Stumme. Tag recommendations in social bookmarking systems. AI Commun., 21(4):231--247, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. G. Karypis. Evaluation of item-based top-n recommendation algorithms. In CIKM '01, pages 247--254,2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Y. Koren. Collaborative filtering with temporal dynamics. In KDD '09, pages 447--456, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. N. Lathia, S. Hailes, and L. Capra. Temporal collaborative filtering with adaptive neighbourhoods. In SIGIR '09, pages 796--797, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. M. Li, B. M. Dias, I. Jarman, W. El-Deredy, and P. J.Lisboa. Grocery shopping recommendations based on basket-sensitive random walk. In KDD '09, pages 1215--1224, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Y. Li and J. Tang. Expertise search in a time-varying social network. In WAIM '08, pages 293--300, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. G. Linden, B. Smith, and J. York. Amazon.com recommendations: Item-to-item collaborative filtering. IEEE Internet Computing, 7(1):76--80, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. N. N. Liu and Q. Yang. Eigenrank: a ranking-oriented approach to collaborative filtering. In SIGIR '08, pages 83--90, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. D. Oard and J. Kim. Implicit feedback for recommender systems. In AAAI Workshop on Recommender Systems, 1998.Google ScholarGoogle Scholar
  17. L. Page, S. Brin, R. Motwani, and T. Winograd. The pagerank citation ranking: Bringing order to the web. Technical report, 1998.Google ScholarGoogle Scholar
  18. P. Resnick, N. Iacovou, M. Suchak, P. Bergstrom, and J. Riedl. Grouplens: an open architecture for collaborative filtering of netnews. In CSCW '94, pages 175--186, 1994. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. F. Ricci and Q. N. Nguyen. Acquiring and revising preferences in a critique-based mobile recommender system. IEEE Intelligent Systems, 22(3):22--29, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. J. Schlimmer and R. Granger. Beyond incremental processing: Tracking concept drift. Proc. 5th National Conference on Artificial Intelligence, pages 502--507,1986.Google ScholarGoogle Scholar
  21. J. Sun, C. Faloutsos, S. Papadimitriou, and P. S. Yu.Graphscope: parameter-free mining of large time-evolving graphs. In KDD '07, pages 687--696, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. J. Sun, D. Tao, and C. Faloutsos. Beyond streams and graphs: dynamic tensor analysis. In KDD '06, pages 374--383, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. A. Toscher and M. Jahrer. The bigchaos solution to the netflix prize 2008. Technical report, 2008.Google ScholarGoogle Scholar
  24. G. Widmer and M. Kubat. Learning in the presence of concept drift and hidden contexts. Mach. Learn., 23(1):69--101, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. A. Zimdars, D. M. Chickering, and C. Meek. Using temporal data for making recommendations. In UAI '01, pages 580--588, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Temporal recommendation on graphs via long- and short-term preference fusion

    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 '10: Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
      July 2010
      1240 pages
      ISBN:9781450300551
      DOI:10.1145/1835804

      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: 25 July 2010

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article

      Acceptance Rates

      Overall Acceptance Rate1,133of8,635submissions,13%

      Upcoming Conference

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader