Top-N Recommendation Based on Preference Bipartite Network
DOI:
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

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

    In view of the bipartite graph method of network-based inference (NBI) only considered whether users evaluated the project or not, but not given their scores, the thesis proposed a preferential network-based inference (PNBI) recommended method. Based on inference network, the method takes into account that user's rating values for the program reflects his degree of preference. In the "User-Item" resource allocation process, the method allocates resources to the item that gets a higher score, this method can overcome the NBI algorithm's disadvantage of failing to use low score value. Considering the sparsity of data, the method uses inverted list to discrese the number of calculation to accelerate the algorithm. Experiments on MovieLens dataset show that, PNBI bipartite graph recommended algorithm outperforms NBI bipartite graph recommended algorithm in accuracy, coverage and recall.

    Reference
    Related
    Cited by
Get Citation

陈添辉,林世平,郭昆,廖寿福.基于偏好的二分图网络模型Top-N推荐.计算机系统应用,2015,24(4):196-200

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:August 12,2014
  • Revised:September 16,2014
  • Adopted:
  • Online: April 24,2015
  • Published:
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