TY - GEN
T1 - Refined node type graph convolutional network for recommendation
AU - He, Wei
AU - Sun, Guohao
AU - Lu, Jinhu
AU - Fang, Xiu
AU - Liu, Guanfeng
AU - Yang, Jian
PY - 2023
Y1 - 2023
N2 - Recently, because of the remarkable performance in alleviating the data sparseness problem in recommender systems, Graph Convolutional (Neural) Networks (GCNs) have drawn wide attention as an effective recommendation approach. By modeling the user-item interaction graph, GCN iteratively aggregates neighboring nodes into embeddings of different depths according to the importance of each node. However, the existing GCN-based methods face the common issues that, they do not consider the node information and graph structure during aggregating nodes, such that they cannot assign reasonable weights to the neighboring nodes. Additionally, they ignore the differences in node types in the user-item interaction graph and thus, cannot explore the complex relationship between users and items, resulting in a suboptimal result. To solve these problems, a novel GCN-based framework called RNT-GCN is proposed in this paper. RNT-GCN integrates the structure of the graph and node information to assign reasonable importance to different nodes. In addition, RNT-GCN refines the node types, such that the heterogeneous properties of the user-item interaction graph can be better preserved, and the collaborative information of users and items can be effectively extracted. Extensive experiments prove the RNT-GCN achieved significant performance compared to SOTA methods.
AB - Recently, because of the remarkable performance in alleviating the data sparseness problem in recommender systems, Graph Convolutional (Neural) Networks (GCNs) have drawn wide attention as an effective recommendation approach. By modeling the user-item interaction graph, GCN iteratively aggregates neighboring nodes into embeddings of different depths according to the importance of each node. However, the existing GCN-based methods face the common issues that, they do not consider the node information and graph structure during aggregating nodes, such that they cannot assign reasonable weights to the neighboring nodes. Additionally, they ignore the differences in node types in the user-item interaction graph and thus, cannot explore the complex relationship between users and items, resulting in a suboptimal result. To solve these problems, a novel GCN-based framework called RNT-GCN is proposed in this paper. RNT-GCN integrates the structure of the graph and node information to assign reasonable importance to different nodes. In addition, RNT-GCN refines the node types, such that the heterogeneous properties of the user-item interaction graph can be better preserved, and the collaborative information of users and items can be effectively extracted. Extensive experiments prove the RNT-GCN achieved significant performance compared to SOTA methods.
KW - Recommender system
KW - Graph convolutional network
KW - User-item interaction graph
UR - http://www.scopus.com/inward/record.url?scp=85177089932&partnerID=8YFLogxK
U2 - 10.1007/978-3-031-46661-8_7
DO - 10.1007/978-3-031-46661-8_7
M3 - Conference proceeding contribution
AN - SCOPUS:85177089932
SN - 9783031466601
T3 - Lecture Notes in Computer Science
SP - 91
EP - 106
BT - Advanced Data Mining and Applications
A2 - Yang, Xiaochun
A2 - Suhartanto, Heru
A2 - Wang, Guoren
A2 - Wang, Bin
A2 - Jiang, Jing
A2 - Li, Bing
A2 - Zhu, Huaijie
A2 - Cui, Ningning
PB - Springer, Springer Nature
CY - Cham
T2 - 19th International Conference on Advanced Data Mining and Applications, ADMA 2023
Y2 - 21 August 2023 through 23 August 2023
ER -