EigenRank: a ranking-oriented approach to collaborative filtering
The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The anatomy of a large-scale hypertextual Web search engine
Brin, S., & Page, L. (1998) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(98)00110-x · Cited by 16,004
Item-based collaborative filtering recommendation algorithms
Sarwar, B., Karypis, G., Konstan, J., & Riedl, J. (2001) · Proceedings of the 10th international conference on World Wide Web · doi:10.1145/371920.372071 · Cited by 9,135 · cited 6×
“Sarwar et al.[24] recommended using the adjusted cosine similarity to compute the item-item similarity and found that the itembased model could obtain higher accuracy than the userbased model, while allowing more efficient computations.”
MethodInfluentialAmazon.com recommendations: item-to-item collaborative filtering
Linden, G., Smith, B., & York, J. (2003) · IEEE Internet Computing · doi:10.1109/mic.2003.1167344 · Cited by 5,403
GroupLens: an open architecture for collaborative filtering of netnews
Resnick, P., Iacovou, N., Suchak, M., Bergstrom, P., & Riedl, J. (1994) · Proceedings of the 1994 ACM conference on Computer supported cooperative work - CSCW '94 · doi:10.1145/192844.192905 · Cited by 5,058
Cumulated gain-based evaluation of IR techniques
Järvelin, K., & Kekäläinen, J. (2002) · ACM Transactions on Information Systems · doi:10.1145/582415.582418 · Cited by 4,841 · cited 1×
“However, since the emphasis of our work is on improving item rankings instead of rating prediction, we employ the Normalized Discounted Cumulative Gain(NDCG)[13] metric, which is an increasingly popular metric for evaluating ranked results in information retrieval where the documents are assigned graded rather than bi…”
MethodLearning to rank using gradient descent
Burges, C., Shaked, T., Renshaw, E., Lazier, A., Deeds, M., Hamilton, N., & Hullender, G. (2005) · Proceedings of the 22nd international conference on Machine learning - ICML '05 · doi:10.1145/1102351.1102363 · Cited by 2,836 · cited 4×
“Various machine learning approaches including ensembles[5, 6], support vector machines[16] and neural networks[4] have been developed for learning such a binary classifier to model the preference function.”
BackgroundMethodInfluentialHaveliwala, T. H. (2002) · Proceedings of the 11th international conference on World Wide Web · doi:10.1145/511446.511513 · Cited by 1,567
Scaling personalized web search
Jeh, G., & Widom, J. (2003) · Proceedings of the twelfth international conference on World Wide Web - WWW '03 · doi:10.1145/775152.775191 · Cited by 1,195 · cited 1×
“A few follow up works to PageRank proposed different methods to bias the personalization vector v to take into account different types of information besides the link structure such as contents[10, 23] and user preferences[14].”
MethodBianchini, M., Gori, M., & Scarselli, F. (2005) · ACM Transactions on Internet Technology · doi:10.1145/1052934.1052938 · Cited by 539 · cited 1×
“In our model, since the transition probabilities p(j|i)’s are calculated using Equation 8, the entries of P are all non-negative, which could guarantee the existence and uniqueness of the stationary distribution π[1].”
Method
Cited by
Recommender systems with social regularization
Ma, H., Zhou, D., Liu, C., Lyu, M. R., & King, I. (2011) · Proceedings of the fourth ACM international conference on Web search and data mining · doi:10.1145/1935826.1935877 · Cited by 1,626
Factorization Machines with libFM
Rendle, S. (2012) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/2168752.2168771 · Cited by 1,337
Learning to recommend with social trust ensemble
Ma, H., King, I., & Lyu, M. R. (2009) · Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1571941.1571978 · Cited by 859
Social Collaborative Filtering by Trust
Yang, B., Lei, Y., Liu, J., & Li, W. (2017) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2016.2605085 · Cited by 671
TriRank: Review-aware Explainable Recommendation by Modeling Aspects
He, X., Chen, T., Kan, M.-Y., & Chen, X. (2015) · Proceedings of the 24th ACM International on Conference on Information and Knowledge Management · doi:10.1145/2806416.2806504 · Cited by 456
Temporal recommendation on graphs via long- and short-term preference fusion
Xiang, L., Yuan, Q., Zhao, S., Chen, L., Zhang, X., Yang, Q., & Sun, J. (2010) · Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1835804.1835896 · Cited by 374
Self-citationCurrent challenges and visions in music recommender systems research
Schedl, M., Zamani, H., Chen, C.-W., Deldjoo, Y., & Elahi, M. (2018) · International Journal of Multimedia Information Retrieval · doi:10.1007/s13735-018-0154-2 · Cited by 315
QoS Ranking Prediction for Cloud Services
Zheng, Z., Wu, X., Zhang, Y., Lyu, M. R., & Wang, J. (2013) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2012.285 · Cited by 309
Collaborative personalized tweet recommendation
Chen, K., Chen, T., Zheng, G., Jin, O., Yao, E., & Yu, Y. (2012) · Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/2348283.2348372 · Cited by 296
Optimizing top-n collaborative filtering via dynamic negative item sampling
Zhang, W., Chen, T., Wang, J., & Yu, Y. (2013) · Proceedings of the 36th international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/2484028.2484126 · Cited by 256
Interactive collaborative filtering
Zhao, X., Zhang, W., & Wang, J. (2013) · Proceedings of the 22nd ACM international conference on Information & Knowledge Management · doi:10.1145/2505515.2505690 · Cited by 165
“In addition, we add a constraint for all the algorithms that the same item should not be repeatedly recommended as suggested in most previous ranking-oriented recommendation settings [28, 40].”
Metadata
- Authors
- Liu, N. N., & Yang, Q.
- Venue
- Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval
- Publisher
- ACM
- Published
- 2008-07-20
- Pages
- 83-90
- OpenAlex
- W2134716712
- Cited by
- 249
- References
- 9
- FWCI
- 11.28
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.