Abstract

Abstract To address the issue of cold start and data sparsity in recommendation algorithms, this paper introduces a knowledge graph to assist intelligent recommendation algorithms in exploring. Firstly, it is introduced that the introduction of knowledge graphs into recommendation algorithms can introduce more semantic relationships as well as mining higher-order connection relationships, thus improving the purpose and user satisfaction. Second, the three categories of extant recommendation techniques—embedding-based, path-based, and propagation-based—are compiled. We examine how the current methods extract data from entities and connections in the knowledge graph and contrast the benefits and drawbacks of the three different types of approaches. Furthermore, the AUC metrics on the three datasets improve by 2.9%, 1.6%, and 1.2% over the state-of-the-art baseline, respectively, showing the effectiveness of the KGAT-CI model in using collaborative and knowledge-aware information, according to experiments on intelligent algorithms in the literature. It may be determined that the addition of knowledge graphs can improve the present recommendation algorithms’ accuracy, variety, and interpretability.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call