Scenic Spot Recommendation Method Integrating Knowledge Graph and Distance Cost

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Aiming at the problem that the traditional collaborative filtering algorithm only considers external ratings and cold start when recommending attractions, this paper proposes an attraction recommendation algorithm integrated with knowledge graph. Firstly, we construct a user rating matrix based on user ratings and the number of reviews, and calculate the similarity of attractions. Then, we use TransR model to train the semantic vector matrix of attractions, and use cosine similarity formula to calculate the semantic similarity of attractions. Finally, the two similarities are fused and applied to ALS matrix factorization. At the same time, in order to make the model pay attention to user preferences and take into account the distance elements in the scenic spots for recommendation, the distance cost is integrated in the loss function. Experimental results on the scenic spots dataset show that the proposed algorithm is better than the traditional method in scenic spots recommendation.

Cite

CITATION STYLE

APA

Shen, Y., & Zhu, X. (2023). Scenic Spot Recommendation Method Integrating Knowledge Graph and Distance Cost. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 14260 LNCS, pp. 325–336). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-44195-0_27

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free