An entropy-based similarity measure for collaborative filtering

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

Abstract

Collaborative filtering is a successfully utilized technique in many online commercial recommender systems. Similarity measures play an important role in this technique, as items preferred by similar users are to be recommended. Although various similarity measures have been developed, they usually treat each pair of user ratings separately or simply combine additional heuristic information with traditional similarity measures. This paper addresses this problem and suggests a new similarity measure which interprets user ratings in view of the global rating behavior on items by exploiting information entropy. Performance of the proposed measure is investigated through various experiments to find that it outperforms the existing similarity measures especially in a small-scaled sparse dataset.

Cite

CITATION STYLE

APA

Lee, S. (2018). An entropy-based similarity measure for collaborative filtering. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10943 LNCS, pp. 129–137). Springer Verlag. https://doi.org/10.1007/978-3-319-93803-5_12

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