.png){kind=icon}
返回
Dynamic evolution of multi-graph based collaborative filtering for recommendation systems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.knosys.2021.107251.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The recommendation system is an important and widely used technology in the era of Big Data. Current methods have fused side information into it to alleviate the sparsity problem, one of the key problems of recommendation systems. However, not all the side information can be obtained with high quality, and the specific methods based on side information are not universal. In addition, side information has not been mined by the existing graph-based methods. To address these problems, we propose a Dynamic evolution of Multi-Graph Collaborative Filtering (DMGCF) model to mine and reuse side information. Specifically, we first construct user graph and item graph based on user-item bipartite graph and embeddings to exploit inter-user and inter-item relationships. The two new graphs simulate side information in latent space. Next, we perform a dual-path graph convolution network (GCN) on these three graphs for collaborative filtering. Then, a novel dynamic evolution mechanism is proposed to update and promote the embeddings and graphs collaboratively during the learning process, which produces better embeddings, user and item relationships, as well as the rating scores. We conduct a series of experiments on real-world datasets, and experimental results show the effectiveness of our approach. (C) 2021 Elsevier B.V. All rights reserved.
Keyword:
Multiple graphs
Collaborative filtering
Graph convolutional network
Rating prediction
Side information
期刊
K
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
引用论文
.png){kind=icon}
分享收藏分享收藏
Querying Dynamic Wireless Sensor Networks with Non-revisiting Random Walks基于非重访随机游走的动态无线传感器网络查询
PREAI
分享收藏
查看更多内容