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

Cong Tran, Jang Young Kim, Won Yong Shin, Sang Wook Kim

Research output: Contribution to journalArticle

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.

Original languageEnglish
Article number8704936
Pages (from-to)62115-62125
Number of pages11
JournalIEEE Access
Volume7
DOIs
Publication statusPublished - 2019 Jan 1

Fingerprint

Collaborative filtering
Recommender systems
Constrained optimization

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Materials Science(all)
  • Engineering(all)

Cite this

Tran, Cong ; Kim, Jang Young ; Shin, Won Yong ; Kim, Sang Wook. / Clustering-Based Collaborative Filtering Using an Incentivized/Penalized User Model. In: IEEE Access. 2019 ; Vol. 7. pp. 62115-62125.
@article{021dcc732e334227ac4e2e315f3505fe,
title = "Clustering-Based Collaborative Filtering Using an Incentivized/Penalized User Model",
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.",
author = "Cong Tran and Kim, {Jang Young} and Shin, {Won Yong} and Kim, {Sang Wook}",
year = "2019",
month = "1",
day = "1",
doi = "10.1109/ACCESS.2019.2914556",
language = "English",
volume = "7",
pages = "62115--62125",
journal = "IEEE Access",
issn = "2169-3536",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

Clustering-Based Collaborative Filtering Using an Incentivized/Penalized User Model. / Tran, Cong; Kim, Jang Young; Shin, Won Yong; Kim, Sang Wook.

In: IEEE Access, Vol. 7, 8704936, 01.01.2019, p. 62115-62125.

Research output: Contribution to journalArticle

TY - JOUR

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

AU - Tran, Cong

AU - Kim, Jang Young

AU - Shin, Won Yong

AU - Kim, Sang Wook

PY - 2019/1/1

Y1 - 2019/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85066841105&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85066841105&partnerID=8YFLogxK

U2 - 10.1109/ACCESS.2019.2914556

DO - 10.1109/ACCESS.2019.2914556

M3 - Article

AN - SCOPUS:85066841105

VL - 7

SP - 62115

EP - 62125

JO - IEEE Access

JF - IEEE Access

SN - 2169-3536

M1 - 8704936

ER -