The recommendation system recommends information and services to users by collecting and analyzing user behaviors. Many current studies have shown that recommendationalgorithms that integrate social network informati...
详细信息
The recommendation system recommends information and services to users by collecting and analyzing user behaviors. Many current studies have shown that recommendationalgorithms that integrate social network information can effectively improve recommendation performance. Most of the existing social recommendation algorithms assume that the trust relationship between users is singular and homogeneous. These social recommendation algorithms generally ignore two problems: (i) in a network of trust relationships, each user has various friends and trust relationships, which have an impact on user ratings. (ii) each user with different social status, which influences also affects the ratings between users. Propose a social network recommendationalgorithm (social Strength Trust recommendationalgorithm, SSTRA) in this paper. Firstly, the algorithm uses the different out-degree and in-degree relationships among different users to calculate the different trust strengths of each user in social networks;secondly, it calculates the social influence of different users through the social ranking algorithm (SocailRank);thirdly, it will be based on the trust strength relationship of social networks and the social influence of users are integrated into the probability matrix factorization model. This method can achieve the purpose of optimizing recommendation results. The experimental results compared on the CiaoDVD dataset show that: Compared with the socialMF, SoRec, RSTE, PMF, and Trust algorithms, the average MAE has increased by 1.33%, 1.69%, 4.88%, 11.17% and 220.41%, and the average RMSE has increased by 1.47%, 1.9%, 5.06%, 7.27%, 217.55%. The experimental results compared on the Ciao dataset show that: Compared with the socialMF, SoRec, RSTE, PMF, and Trust algorithms, the average MAE is increased by 4.83%, 5.05%, 1.96%, 5.58%, 143.39%, and the average RMSE is increased by 1.76%, 2.17%, 2.1%, 2.38%, 151.1%. Experimental results show that the algorithm has obvious advantages
Recommender systems have revolutionized the way users discover and engage with content. Moving beyond the collaborative filtering approach, most modern recommender systems leverage additional sources of information, s...
详细信息
Recommender systems have revolutionized the way users discover and engage with content. Moving beyond the collaborative filtering approach, most modern recommender systems leverage additional sources of information, such as context and social network data. Such data can be modeled using graphs, and the recent advances in Graph Neural Networks have led to the prominence of a new family of graph-based recommender system algorithms. In this work, we propose the RelationalNet algorithm, which not only models user-item, and user-user relationships but also item-item relationships with graphs and uses them as input to the recommendation process. The rationale for utilizing item-item interactions is to enrich the item embeddings by leveraging the similarities between items. By using Graph Neural Networks (GNNs), RelationalNet incorporates social influence and similar item influence into the recommendation process and captures more accurate user interests, especially when traditional methods fall short due to data sparsity. Such models improve the accuracy and effectiveness of recommendation systems by leveraging social connections and item interactions. Results demonstrate that RelationalNet outperforms current state-of-the-art social recommendation algorithms.
暂无评论