research-article

EigenRank: a ranking-oriented approach to collaborative filtering

Authors:

Qiang YangAuthors Info & Claims

SIGIR '08: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval

Pages 83 - 90

https://doi.org/10.1145/1390334.1390351

Published: 20 July 2008 Publication History

Abstract

A recommender system must be able to suggest items that are likely to be preferred by the user. In most systems, the degree of preference is represented by a rating score. Given a database of users' past ratings on a set of items, traditional collaborative filtering algorithms are based on predicting the potential ratings that a user would assign to the unrated items so that they can be ranked by the predicted ratings to produce a list of recommended items. In this paper, we propose a collaborative filtering approach that addresses the item ranking problem directly by modeling user preferences derived from the ratings. We measure the similarity between users based on the correlation between their rankings of the items rather than the rating values and propose new collaborative filtering algorithms for ranking items based on the preferences of similar users. Experimental results on real world movie rating data sets show that the proposed approach outperforms traditional collaborative filtering algorithms significantly on the NDCG measure for evaluating ranked results.

References

[1]

M. Bianchini, M. Gori, and F. Scarselli. Inside pagerank. ACM Trans. Internet Technology, 5(1):92--128, 2005.

Digital Library

[2]

J. S. Breese, D. Heckerman, and C. Kadie. Empirical analysis of predictive algorithms for collaborative filtering. In Proceedings of UAI 1998, pages 43--52, 1998.

Digital Library

[3]

S. Brin and L. Page. Anatomy of a large-scale hypertextual web search engine. In Proceedings of 7th International World Wide Web Conference, 1998.

Digital Library

[4]

C. Burges, T. Shaked, E. Renshaw, A. Lazier, M. Deeds, N. Hamilton, and G. Hullender. Learning to rank using gradient descent. In Proceedings of ICML 2005, pages 89--96, 2005.

Digital Library

[5]

W. W. Cohen, R. E. Schapire, and Y. Singer. Learning to order things. Journal of Artificial Intelligence Research, 5:243--270, 1999.

Digital Library

[6]

Y. Freund, R. Iyer, R. E. Schapire, and Y. Singer. An efficient boosting algorithm for combining preferences. In Proceedings of ICML 1998, pages 170--178, 1998.

Digital Library

[7]

M. R. Gary and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York, 1979.

Digital Library

[8]

K. Y. Goldberg, T. Roeder, D. Gupta, and C. Perkins. Eigentaste: A constant time collaborative filtering algorithm. Information Retrieval, 4(2):133--151, 2001.

Digital Library

[9]

K. Y. Goldberg, T. Roeder, D. Gupta, and C. Perkins. Eigentaste: A constant time collaborative filtering algorithm. Information Retrieval, 4(2):133--151, 2001.

Digital Library

[10]

T. H. Haveliwala. Topic-sensitive pagerank. In Proceedings of WWW 2002, 2002.

Digital Library

[11]

J. Herlocker, J. A. Konstan, and J. Riedl. An empirical analysis of design choices in neighborhood-based collaborative filtering algorithms. Information retrieval, 5(4):287--310, 2002.

Digital Library

[12]

T. Hofmann. Latent semantic models for collaborative filtering. ACM Trans. Inf. Syst., 22(1):89--115, 2004.

Digital Library

[13]

K. Järvelin and J. Kekäläinen. Cumulated gain-based evaluation of ir techniques. ACM Trans. Inf. Syst., 20(4):422--446, 2002.

Digital Library

[14]

G. Jeh and J. Widom. Scaling personalized web search. In Proceedings of WWW 2003, pages 271--279, 2003.

Digital Library

[15]

R. Jin, L. Si, C. Zhai, and J. Callan. Collaborative filtering with decoupled models for preferences and ratings. In Proceedings of CIKM 2003, pages 309--106, 2003.

Digital Library

[16]

T. Joachims. Optimizing search engines using clickthrough data. In Proceedings of SIGKDD 2002, pages 133--142, 2002.

Digital Library

[17]

J. A. Konstan, B. N. Miller, D. Maltz, J. L. Herlocker, L. R. Gordon, and J. Riedl. Grouplens: Applying collaborative filtering to usenet news. Commun. ACM, 40(3):77--87, 1997.

Digital Library

[18]

G. Linden, B. Smith, and J. York. Amazon.com recommendations: Item-to-item collaborative filtering. IEEE Internet Computing, 7(1):76--80, 2003.

Digital Library

[19]

H. Ma, I. King, and M. R. Lyu. Effective missing data prediction for collaborative filtering. In Proc. of SIGIR 2007, pages 39--46, 2007.

Digital Library

[20]

J. I. Marden. Analyzing and Modeling Rank Data. Chapman & Hall, New York, 1995.

[21]

D. M. Pennock, E. Horvitz, S. Lawrence, and C. L. Giles. Collaborative filtering by personality diagnosis: A hybrid memory and model-based approach. In Proc. of UAI, pages 473--480, 2000.

Digital Library

[22]

P. Resnick, N. Iacovou, M. Suchak, P. Bergstrom, and J. Riedl. Grouplens: An open architecture for collaborative filtering of netnews. In Proc. of ACM Conference on Computer Supported Cooperative Work, pages 175--186, 1994.

Digital Library

[23]

M. Richardson and P. Domingos. The intelligent surfer: Probabilistic combination of link and content information in pagerank. In Proceedings of NIPS 2001, pages 1441--1448, 2001.

[24]

B. M. Sarwar, G. Karypis, J. A. Konstan, and J. Riedl. Item-based collaborative filtering recommendation algorithms. In WWW, pages 285--295, 2001.

Digital Library

[25]

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 Proc. of SIGIR 2005, pages 114--121, 2005.

Digital Library

Cited By

Qiu ZHu QZhong YTu WZhang LYang T(2025)Optimal large-scale stochastic optimization of NDCG surrogates for deep learningMachine Learning10.1007/s10994-024-06631-x114:2Online publication date: 27-Jan-2025
https://doi.org/10.1007/s10994-024-06631-x
Maya S(2024)GDRMA: Graph Neural Networks for Document Retrievals with Mean AggregationIEEE Access10.1109/ACCESS.2024.3512597(1-1)Online publication date: 2024
https://doi.org/10.1109/ACCESS.2024.3512597
Li LLiu ZZhang ZChen HWu X(2023)Three-way Preference Completion via Preference GraphACM Transactions on Knowledge Discovery from Data10.1145/358036817:6(1-19)Online publication date: 1-Mar-2023
https://dl.acm.org/doi/10.1145/3580368
Show More Cited By

Index Terms

EigenRank: a ranking-oriented approach to collaborative filtering
1. Information systems
  1. Information retrieval
    1. Retrieval tasks and goals
      1. Document filtering
      2. Information extraction

Recommendations

Serendipitous recommendations via innovators
SIGIR '10: Proceedings of the 33rd international ACM SIGIR conference on Research and development in information retrieval

To realize services that provide serendipity, this paper assesses the surprise of each user when presented recommendations. We propose a recommendation algorithm that focuses on the search time that, in the absence of any recommendation, each user would ...
A random walk method for alleviating the sparsity problem in collaborative filtering
RecSys '08: Proceedings of the 2008 ACM conference on Recommender systems

Collaborative Filtering is one of the most widely used approaches in recommendation systems which predicts user preferences by learning past user-item relationships. In recent years, item-oriented collaborative filtering methods came into prominence as ...
Unifying rating-oriented and ranking-oriented collaborative filtering for improved recommendation

We propose a novel unified recommendation model, URM, which combines a rating-oriented collaborative filtering (CF) approach, i.e., probabilistic matrix factorization (PMF), and a ranking-oriented CF approach, i.e., list-wise learning-to-rank with ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SIGIR '08: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval

July 2008

934 pages

ISBN:9781605581644

DOI:10.1145/1390334

General Chairs:
Tat-Seng Chua
National University of Singapore
,
Mun-Kew Leong
National Library Board, Singapore
,
Program Chairs:
Syung Hyon Myaeng
Information and Communications University, Korea
,
Douglas W. Oard
University of Maryland, College Park, USA
,
Fabrizio Sebastiani
Consiglio Nazionale delle Ricerche, Italy

Copyright © 2008 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]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 20 July 2008

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

SIGIR '08

Sponsor:

SIGIR '08: The 31st Annual International ACM SIGIR Conference

July 20 - 24, 2008

Singapore, Singapore

Acceptance Rates

Overall Acceptance Rate 792 of 3,983 submissions, 20%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

203
Total Citations
View Citations
1,814
Total Downloads

Downloads (Last 12 months)19
Downloads (Last 6 weeks)2

Reflects downloads up to 01 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Qiu ZHu QZhong YTu WZhang LYang T(2025)Optimal large-scale stochastic optimization of NDCG surrogates for deep learningMachine Learning10.1007/s10994-024-06631-x114:2Online publication date: 27-Jan-2025
https://doi.org/10.1007/s10994-024-06631-x
Maya S(2024)GDRMA: Graph Neural Networks for Document Retrievals with Mean AggregationIEEE Access10.1109/ACCESS.2024.3512597(1-1)Online publication date: 2024
https://doi.org/10.1109/ACCESS.2024.3512597
Li LLiu ZZhang ZChen HWu X(2023)Three-way Preference Completion via Preference GraphACM Transactions on Knowledge Discovery from Data10.1145/358036817:6(1-19)Online publication date: 1-Mar-2023
https://dl.acm.org/doi/10.1145/3580368
Wang XChen HZhou YMa JZhu W(2023)Disentangled Representation Learning for RecommendationIEEE Transactions on Pattern Analysis and Machine Intelligence10.1109/TPAMI.2022.315311245:1(408-424)Online publication date: 1-Jan-2023
https://doi.org/10.1109/TPAMI.2022.3153112
Gao HQin XBarroso RHussain WXu YYin Y(2022)Collaborative Learning-Based Industrial IoT API Recommendation for Software-Defined Devices: The Implicit Knowledge Discovery PerspectiveIEEE Transactions on Emerging Topics in Computational Intelligence10.1109/TETCI.2020.30231556:1(66-76)Online publication date: Feb-2022
https://doi.org/10.1109/TETCI.2020.3023155
Wang CYang YSuo KWang P(2022)MulSetRank: Multiple set ranking for personalized recommendation from implicit feedbackKnowledge-Based Systems10.1016/j.knosys.2022.108946249(108946)Online publication date: Aug-2022
https://doi.org/10.1016/j.knosys.2022.108946
Xu BLin HYang LLin YXu K(2022)Cognitive Knowledge-aware Social Recommendation via Group-enhanced Ranking ModelCognitive Computation10.1007/s12559-022-10001-x14:3(1055-1067)Online publication date: 17-Feb-2022
https://doi.org/10.1007/s12559-022-10001-x
Ma WLiao XDai WPan WMing Z(2021)Holistic Transfer to Rank for Top-N RecommendationACM Transactions on Interactive Intelligent Systems10.1145/343436011:1(1-1)Online publication date: 15-Mar-2021
https://dl.acm.org/doi/10.1145/3434360
Liu HNicolae BDi SCappello FJog A(2021)Accelerating DNN Architecture Search at Scale Using Selective Weight Transfer2021 IEEE International Conference on Cluster Computing (CLUSTER)10.1109/Cluster48925.2021.00051(82-93)Online publication date: Sep-2021
https://doi.org/10.1109/Cluster48925.2021.00051
Khojamli HRazmara J(2021)Survey of similarity functions on neighborhood-based collaborative filteringExpert Systems with Applications: An International Journal10.1016/j.eswa.2021.115482185:COnline publication date: 15-Dec-2021
https://dl.acm.org/doi/10.1016/j.eswa.2021.115482
Show More Cited By

View Options

Login options

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

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten