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

Citations

WEB OF SCIENCE

18
Citations

SCOPUS

23

초록

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 F-1 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 F-1 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 F-1 score for a given precision.

키워드

Clusteringcollaborative filteringF-1 scoreincentivized/penalized user modelPearson correlation coefficientrecommender systemRECOMMENDER SYSTEMSATTRIBUTESVALIDITYIMPROVE
제목
Clustering-Based Collaborative Filtering Using an Incentivized/Penalized User Model
저자
Tran, CongKim, Jang-YoungShin, Won-YongKim, Sang-Wook
DOI
10.1109/ACCESS.2019.2914556
발행일
2019-05
유형
Article
저널명
IEEE Access
7
페이지
62115 ~ 62125

파일 다운로드