Graph Representation-Based Deep Multi-View Semantic Similarity Learning Model for Recommendation

• Published in: Future internet Vol. 14; no. 2; p. 32
• Main Authors: Song, Jiagang, Song, Jiayu, Yuan, Xinpan, He, Xiao, Zhu, Xinghui
• Format: Journal Article
• Language: English
• Published: Basel MDPI AG 01.02.2022
• Subjects: Algorithms; Cold; Collaboration; collaborative filtering; Decomposition; Filtration; graph embedding; Graph representations; Graphical representations; GraphSAGE; Internet; Ratings & rankings; Recommender systems; Social networks; Sparsity; Trust
• ISSN: 1999-5903; 1999-5903
• DOI: 10.3390/fi14020032

With the rapid development of Internet technology, how to mine and analyze massive amounts of network information to provide users with accurate and fast recommendation information has become a hot and difficult topic of joint research in industry and academia in recent years. One of the most widely used social network recommendation methods is collaborative filtering. However, traditional social network-based collaborative filtering algorithms will encounter problems such as low recommendation performance and cold start due to high data sparsity and uneven distribution. In addition, these collaborative filtering algorithms do not effectively consider the implicit trust relationship between users. To this end, this paper proposes a collaborative filtering recommendation algorithm based on graphsage (GraphSAGE-CF). The algorithm first uses graphsage to learn low-dimensional feature representations of the global and local structures of user nodes in social networks and then calculates the implicit trust relationship between users through the feature representations learned by graphsage. Finally, the comprehensive evaluation shows the scores of users and implicit users on related items and predicts the scores of users on target items. Experimental results on four open standard datasets show that our proposed graphsage-cf algorithm is superior to existing algorithms in RMSE and MAE.