Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Category Preferred Canopy-K-means based Collaborative Filtering algorithm
Department of Computer Science and Technology, University of Science and Technology, Beijing.
Department of Computer Science and Technology, University of Science and Technology, Beijing.
Department of Computer Science and Technology, University of Science and Technology, Beijing.
Department of Computer Science and Technology, University of Science and Technology, Beijing.
Show others and affiliations
2018 (English)In: Future generations computer systems, ISSN 0167-739X, E-ISSN 1872-7115Article in journal (Refereed) Epub ahead of print
Abstract [en]

It is the era of information explosion and overload. The recommender systems can help people quickly get the expected information when facing the enormous data flood. Therefore, researchers in both industry and academia are also paying more attention to this area. The Collaborative Filtering Algorithm (CF) is one of the most widely used algorithms in recommender systems. However, it has difficulty in dealing with the problems of sparsity and scalability of data. This paper presents Category Preferred Canopy-K-means based Collaborative Filtering Algorithm (CPCKCF) to solve the challenges of sparsity and scalability of data. In particular, CPCKCF proposes the definition of the User-Item Category Preferred Ratio (UICPR), and use it to compute the UICPR matrix. The results can be applied to cluster the user data and find the nearest users to obtain prediction ratings. Our experimentation results performed using the MovieLens dataset demonstrates that compared with traditional user-based Collaborative Filtering algorithm, the proposed CPCKCF algorithm proposed in this paper improved computational efficiency and recommendation accuracy by 2.81%.

Place, publisher, year, edition, pages
Elsevier, 2018.
National Category
Media and Communication Technology
Research subject
Pervasive Mobile Computing
Identifiers
URN: urn:nbn:se:ltu:diva-68939DOI: 10.1016/j.future.2018.04.025OAI: oai:DiVA.org:ltu-68939DiVA, id: diva2:1210435
Available from: 2018-05-28 Created: 2018-05-28 Last updated: 2018-08-08

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Authority records BETA

Mitra, Karan

Search in DiVA

By author/editor
Mitra, Karan
By organisation
Computer Science
In the same journal
Future generations computer systems
Media and Communication Technology

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 12 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf