A new effective collaborative filtering algorithm based on user's interest partition

He Keqin, He Liang, Xia Weiwei

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

Traditional collaborative filtering algorithms all suffer from inaccurate recommendation and bad scalability. In this paper, we propose a new collaborative filtering algorithm based on user's interest partition. We divides user's whole interest into pieces. Each piece of interest is called interest unit. And the similarity between users on interest unit is named local similarity. The similarity between users on whole interest is named holistic similarity which is similar with the traditional similarity. Our approach searches the nearest neighbors of active user according to the linear combination of local similarity and holistic similarity. Through experiments, thealgorithm can solve the problem of high sparsity on user-item matrix. Our algorithm also has a better quality on recommendation according to experiments.

Original languageEnglish
Title of host publicationProceedings - International Symposium on Computer Science and Computational Technology, ISCSCT 2008
Pages727-731
Number of pages5
DOIs
StatePublished - 2008
EventInternational Symposium on Computer Science and Computational Technology, ISCSCT 2008 - Shanghai, China
Duration: 20 Dec 200822 Dec 2008

Publication series

NameProceedings - International Symposium on Computer Science and Computational Technology, ISCSCT 2008
Volume1

Conference

ConferenceInternational Symposium on Computer Science and Computational Technology, ISCSCT 2008
Country/TerritoryChina
CityShanghai
Period20/12/0822/12/08

Keywords

  • Collaborative filtering
  • Interest model
  • Interest partition
  • Local interest
  • Recommender system

Fingerprint

Dive into the research topics of 'A new effective collaborative filtering algorithm based on user's interest partition'. Together they form a unique fingerprint.

Cite this