Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • 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
Research on collaborative filtering algorithm based on knowledge graph and long tail
Blekinge Institute of Technology, Faculty of Computing, Department of Computer Science.
2019 (English)Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
Abstract [en]

Background: With the popularization of the Internet and the development of information technology, the network information data has shown an explosive growth, and the problem of information overload [1] has been highlighted. In order to help users, find the information they are interested in from a large amount of information, and help information producers to let their own information be concerned by the majority of users, the recommendation system came into being.   Objectives: However, the sparseness problem, the neglect of semantic information, and the failure to consider the coverage rate faced by the traditional recommendation system limit the effect of the recommendation system to some extent. So in this paper I want to deal with these problems. Methods: This paper improves the performance of the recommendation system by constructing a knowledge graph in the domain and using knowledge embedding technology (openKE), combined with the collaborative filtering algorithm based on the long tail theory. And I use 3 experiments to verify this proposed approach’s performance of recommendation and the ability to dig the long tail information, I compared it with some other collaborative filtering algorithms.  Results: The results show that the proposed approach improves the precision, recall and coverage and has a better ability to mine the long tail information. Conclusion: The proposed method improves the recommended performance by reducing the sparsity of the matrix and mining the semantic information between the items. At the same time, the long tail theory is considered, so that users can be recommended to more items that may be of interest. 

Place, publisher, year, edition, pages
2019. , p. 33
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:bth-18828OAI: oai:DiVA.org:bth-18828DiVA, id: diva2:1367043
Subject / course
DV2572 Master´s Thesis in Computer Science
Educational program
DVADA Master Qualification Plan in Computer Science
Supervisors
Examiners
Available from: 2019-11-04 Created: 2019-10-31 Last updated: 2019-11-04Bibliographically approved

Open Access in DiVA

Research on collaborative(731 kB)12 downloads
File information
File name FULLTEXT02.pdfFile size 731 kBChecksum SHA-512
c876289f35f888cd52037ad5fd2c4e7f0b42ab54109e34d6d2c300436379a0cdc14c742de15ef473270b761396573c7670839e75dcdac0d5fcf7f6b7160d64d6
Type fulltextMimetype application/pdf

By organisation
Department of Computer Science
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar
Total: 12 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 15 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • 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