Network Representation Learning Enhanced Recommendation Algorithm

11Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

With the popularity of social network applications, more and more recommender systems utilize trust relationships to improve the performance of traditional recommendation algorithms. Social-network-based recommendation algorithms generally assume that users with trust relations usually share common interests. However, the performance of most of the existing social-network-based recommendation algorithms is limited by the coarse-grained and sparse trust relationships. In this paper, we propose a network representation learning enhanced recommendation algorithm. Specifically, we first adopt a network representation technique to embed social network into a low-dimensional space, and then utilize the low-dimensional representations of users to infer fine-grained and dense trust relationships between users. Finally, we integrate the fine-grained and dense trust relationships into the matrix factorization model to learn user and item latent feature vectors. The experimental results on real-world datasets show that our proposed approach outperforms traditional social-network-based recommendation algorithms.

Cite

CITATION STYLE

APA

Wang, Q., Yu, Y., Gao, H., Zhang, L., Cao, Y., Mao, L., … Ni, W. (2019). Network Representation Learning Enhanced Recommendation Algorithm. IEEE Access, 7, 61388–61399. https://doi.org/10.1109/ACCESS.2019.2916186

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