Exploiting Bhattacharyya similarity measure to diminish user cold-start problem in sparse data

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

Abstract

Collaborative Filtering (CF) is one of the most successful approaches for personalized product recommendations. Neighborhood based collaborative filtering is an important class of CF, which is simple and efficient product recommender system widely used in commercial domain. However, neighborhood based CF suffers from user cold-start problem. This problem becomes severe when neighborhood based CF is used in sparse rating data. In this paper, we propose an effective approach for similarity measure to address user cold-start problem in sparse rating dataset. Our proposed approach can find neighbors in the absence of co-rated items unlike existing measures. To show the effectiveness of this measure under cold-start scenario, we experimented with real rating datasets. Experimental results show that our approach based CF outperforms state-of-the art measures based CFs for cold-start problem.

Cite

CITATION STYLE

APA

Patra, B. K., Launonen, R., Ollikainen, V., & Nandi, S. (2014). Exploiting Bhattacharyya similarity measure to diminish user cold-start problem in sparse data. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8777, pp. 252–263). Springer Verlag. https://doi.org/10.1007/978-3-319-11812-3_22

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