Collaborative filtering recommendation algorithm using dynamic similar neighbor probability

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

Abstract

In this paper, we focus on how to overcome several limitations in the traditional research of collaborative filtering(CF). We present a novel CF recommendation algorithm, named DSNP(Dynamic Similar Neighbor Probability). This algorithm improves the neighbors' similarities computations of both users and items to choose the neighbors dynamically as the recommendation sets. How to select the confident subsets which are the most effective neighbors to the target object, it is the first stage. A major innovation is by defining a dynamic neighbor probability over the trustworthy subsets. Moreover, we define a prediction algorithm that combines the advantages of dynamic neighbor coefficient with the user-based CF and the item-based CF algorithms. Experimental results show that the algorithm can achieve consistently better prediction accuracy than traditional CF algorithms, and effectively leverage the result between user-based CF and item-based CF. Furthermore, the algorithm can alleviate the dataset sparsity problem. © 2009 Springer.

Cite

CITATION STYLE

APA

Huang, C., Yin, J., Wang, J., & Zheng, L. (2009). Collaborative filtering recommendation algorithm using dynamic similar neighbor probability. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5678 LNAI, pp. 165–174). https://doi.org/10.1007/978-3-642-03348-3_18

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