Affiliation:
1. Xi’an Peihua University, Xi’an 710100, China
Abstract
With the development of information technology and the popularity of the Internet, the data on the network is growing exponentially. Information overload has become a significant issue for consumers seeking information. A recommendation system was created to detect users’ interests from huge amounts of data and to suit users’ specific information needs. Traditional collaborative filtering recommendation mostly uses scoring data for a recommendation, which has the problem of sparse data, which limits the performance of the recommendation system. On this basis, this paper studies the personalized recommendation algorithm of scenic spots with deep migration. Through the analysis of collaborative filtering recommendation methods, it is found that the traditional collaborative filtering methods only use scoring data for a recommendation, which has the problem of sparse data. Based on the vectorization of user interest, the similarity of user preference is calculated, and the matrix decomposition is carried out in cooperation with user implicit feedback, to integrate the knowledge transfer information into the matrix decomposition model, and make up for the lack of considering the attribute information of scenic spots in the matrix decomposition algorithm, and alleviate the problem of data sparsity. The findings of comparative trials suggest that the personalized scenic location recommendation approach proposed in this study, which is based on the depth migration algorithm, is effective. Compared with the benchmark recommendation method, the recommendation accuracy and recall rate has been improved to a certain extent.
Funder
Education Department of Shaanxi Province
Subject
General Engineering,General Mathematics
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献