Clustering-Based Collaborative Filtering Using an Incentivized/Penalized User Model

22Citations
Citations of this article
41Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Giving or recommending appropriate content based on the quality of experience is the most important and challenging issue in recommender systems. As collaborative filtering (CF) is one of the most prominent and popular techniques used for recommender systems, we propose a new clustering-based CF (CBCF) method using an incentivized/penalized user (IPU) model only with the ratings given by users, which is thus easy to implement. We aim to design such a simple clustering-based approach with no further prior information while improving the recommendation accuracy. To be precise, the purpose of CBCF with the IPU model is to improve recommendation performance such as precision, recall, and F1 score by carefully exploiting different preferences among users. Specifically, we formulate a constrained optimization problem in which we aim to maximize the recall (or equivalently F1 score) for a given precision. To this end, users are divided into several clusters based on the actual rating data and Pearson correlation coefficient. Afterward, we give each item an incentive/penalty according to the preference tendency by users within the same cluster. Our experimental results show a significant performance improvement over the baseline CF scheme without clustering in terms of recall or F1 score for a given precision.

Cite

CITATION STYLE

APA

Tran, C., Kim, J. Y., Shin, W. Y., & Kim, S. W. (2019). Clustering-Based Collaborative Filtering Using an Incentivized/Penalized User Model. IEEE Access, 7, 62115–62125. https://doi.org/10.1109/ACCESS.2019.2914556

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