.png){kind=icon}
.png){kind=icon}
Return
Higher-Order Smoothness Enhanced Graph Collaborative Filtering
.png){kind=icon}
PRE
AI
DOI：10.1109/TBDATA.2024.3453758.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Graph Neural Networks (GNNs) based recommendations have shown significant performance improvement by explicitly modeling the user-item interactions as a bipartite graph. However, the existing GNNs-based recommendation methods suffer from the over-smoothing problem caused by utilizing the uniform distance of the reception field. To address this issue, we propose to explicitly incorporate the higher-order smoothness information into the node representation learning, and propose a new GNNs-based recommendation model named Higher-order Smoothness enhanced Graph Collaborative Filtering (HS-GCF). The proposed model is mainly composed of two parts, namely lower-order module and higher-order module. The lower-order module guarantees that the lower-order smoothness is well obtained by using the user-item interactions. The higher-order module uses the latent group assumption to restrict too much noise introduced by the uniform distance property, which we call the higher-order smoothness information. Experiments are conducted on three real-world public datasets, and the experimental results show the performance improvements compared with several state-of-the-art methods and verify the importance of explicitly incorporating the higher-order smoothness information into the node representation learning.
Keywords:
Collaborative filtering
Data models
Big Data
Bipartite graph
Predictive models
Representation learning
Symmetric matrices
graph neural network
over-smoothing
higher-order
normalized cut
Journal
I
IF:
5.7
Papers:
834
Citations:
3.0K