.png){kind=icon}
返回
CateReg: category regularization of graph convolutional networks based collaborative filtering
.png){kind=icon}
PRE
AI
DOI：10.1007/s10489-022-04073-3.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Recent years have witnessed the compelling improvement of collaborative filtering (CF) techniques that enjoy the expressive power of graph convolutional networks (GCNs). Unfortunately, there is an intrinsic drawback that limits GCNs to benefit from deep architecture, namely, the oversmoothing phenomenon wherein all nodes in the graph asymptotically incline towards the same representation. We find that this issue also exists in graph neural network based CF models. To cope with this problem, in this work we propose a regularization technique termed CateReg that punishes the distances between two nodes in the embedding space according to the category(i.e., user-item, user-user and item-item interactions) of their relationships. By optimizing the calculation process, we reduce the time complexity of distance computing from o(n(2)) to o(n). The evaluation experiments are carried out over several representative recommendation datasets. The effectiveness of our regularization method is demonstrated with about 2.3% and 2.6% improvements on the state-of-the-art model w.r.t Recall and NDGC, respectively.
Keyword:
Recommendation systems
Graph neural network
Oversmoothing
期刊
IF:
3.5
论文数:
7.6K
被引数:
1.7W
机构
引用论文
Conjugated heat transfer and temperature distributions in a gas turbine combustion liner under base-load operation基本负荷运行下燃气轮机燃烧衬里中的共轭传热和温度分布
PREAI
分享收藏Seismic anisotropy indicates organized melt beneath the Mid-Atlantic Ridge aids seafloor spreading.png)
Geology
OAAI
GeologyIF0
OAAI分享收藏
查看更多内容