SimRate: Improve collaborative recommendation based on rating graph for sparsity

3Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Collaborative filtering is a widely used recommending method. But its sparsity problem often happens and makes it defeat when rate data is too few to compute the similarity of users. Sparsity problem also could result into error recommendation. In this paper, the notion of SimRank is used to overcome the problem. Especially, a novel weighted SimRank for rate bi-partite graph, SimRate, is proposed to compute similarity between users and to determine the neighbor users. SimRate still work well for very sparse rate data. The experiments show that SimRate has advantage over state-of-the-art method. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Yu, L., Shu, Z., & Yang, X. (2010). SimRate: Improve collaborative recommendation based on rating graph for sparsity. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6441 LNAI, pp. 167–174). https://doi.org/10.1007/978-3-642-17313-4_17

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free