New algorithm for collaborative filtering recommendation systemrelated problem solving
DOI:
CSTR:
Author:
Affiliation:

School of Electronic Information Engineering, Tianjin University, Tianjin 300072, China

Clc Number:

TN82

Fund Project:

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

    In this paper,a fusion of singular value decomposition and clustering algorithm named SVD biKmeans collaborative filtering (SBKCF) is proposed, in order to solve the scalability and sparsity problems in user based collaborative filtering system. The algorithm adopts improved Pearson similarity metric formula to measure similarity between users, and clustering those users which have been dimension reducted, then generates the recommendation list through the nearest neighbor cluster of users. Experimental results show that the proposed algorithm can effectively accomplish the mission of personalized recommendation and solve the scalability and sparsity problems in userbased collaborative filtering system.

    Reference
    Related
    Cited by
Get Citation
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:
  • Revised:
  • Adopted:
  • Online: July 01,2016
  • Published:
Article QR Code