Collaborative Filtering Algorithm Based on Clustering and Incentive/Penalty User Model
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    Giving or recommending appropriate content based on the quality of experience is the most important in recommender systems. This study proposes a new CBCF (Clustering-Based CF) method using an Incentivized/Penalized User (IPU) model, which is thus easy to implement. The purpose of this study is to improve recommendation performance of accuracy, recall and F1-score by studying the differences of users’ preferences through IPU model. This study formulates 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. Experiments show that under the condition of given accuracy, the recall rate of the proposed algorithm can be improved by about 50%.

    Reference
    Related
    Cited by
Get Citation

吴青洋,程旭,邓程鹏,丁浩轩,张宏,林胜海.基于聚类和奖惩用户模型的协同过滤算法.计算机系统应用,2020,29(8):135-143

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:November 12,2019
  • Revised:December 23,2019
  • Adopted:
  • Online: July 31,2020
  • Published: August 15,2020
Article QR Code
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-3
Address:4# South Fourth Street, Zhongguancun,Haidian, Beijing,Postal Code:100190
Phone:010-62661041 Fax: Email:csa (a) iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063