.png){kind=icon}
.png){kind=icon}
Return
An Interpretable and Scalable Recommendation Method Based on Network Embedding
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2019.2891513.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Matrix factorization is a widely used technique in recommender systems. However, its performance is often affected by the sparsity and the scalability. To address the above-mentioned problem, we propose an interpretable and scalable recommendation method based on network embedding (ISRM_NE) in this paper. First, a novel user-item co-occurrence network is presented, which reflects both the user's preferences and the co-occurrence relationship among items. Second, the conceptions of tightness and equivalence are given to describe the structural similarity in the network, which can explore four relationships in recommender system: user's preference, item co-occurrence relationship, user's potential preference, and similarity between users. Finally, two sampling strategies are combined to traverse the network so as to get the latent vector of items and users through network representation learning. Thus, the top-N recommendation can be achieved by vector computing. The proposed method called ISRM_NE improves the performance of the recommender system in terms of interpretability and scalability. Moreover, extensive experiments on two real-world datasets demonstrate that the ISRM_NE outperforms three popular methods.
Keywords:
Recommender systems
computer science
data mining
information processing
information technology
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.