A hybrid CBR approach for the long tail problem in recommender systems

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

Abstract

Recommender systems is an important tool to help users find relevant items to their interests in a variety of products and services including entertainment, news, research articles, and others. Recommender systems generate lists of recommendations/suggestions based on information from past user interactions, choices, demographic information as well as using machine learning and data mining. The most popular techniques for generating recommendations are through content-based and collaborative filtering with the latter used to provide user to user recommendations. However, collaborative filtering suffers from the long tail problem, i.e., it does not work correctly with items that contain a small number of ratings over large item populations with respectively large numbers of ratings. In this paper, we propose a novel approach towards addressing the long tail recommendation problem by applying Case-based Reasoning on “user history” to predict the rating of newly seen items which seem to belong to the long tail. We present a hybrid approach and a framework implemented with jCOLIBRI to evaluate it using the freely available Movielens dataset [8]. Our results seem promising and they seem to improve the existing prediction outcomes from the available literature.

Cite

CITATION STYLE

APA

Alshammari, G., Jorro-Aragoneses, J. L., Kapetanakis, S., Petridis, M., Recio-García, J. A., & Díaz-Agudo, B. (2017). A hybrid CBR approach for the long tail problem in recommender systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10339 LNAI, pp. 35–45). Springer Verlag. https://doi.org/10.1007/978-3-319-61030-6_3

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