Node-personalized multi-graph convolutional networks for recommendation

Graph neural networks have revealed powerful potential in ranking recommendation. Existing methods based on bipartite graphs for ranking recommendation mainly focus on homogeneous graphs and usually treat user and item nodes as the same kind of nodes, however, the user-item bipartite graph is always heterogeneous. Additionally, various types of nodes have varying effects on recommendations, and a good node representation can be learned by successfully differentiating the same type of nodes. In this paper, we develop a nodepersonalized multi -graph convolutional network (NP-MGCN) for ranking recommendation. It consists of a node importance awareness block, a graph construction module, and a node information propagation and aggregation framework. Specifically, a node importance awareness block is proposed to encode nodes using node degree information to highlight the differences between nodes. Subsequently, the Jaccard similarity and co -occurrence matrix fusion graph construction module is devised to acquire user-user and item-item graphs, enriching correlation information between users and between items. Finally, a composite hop node information propagation and aggregation framework, including single -hop and double -hop branches, is designed. The high -order connectivity is used to aggregate heterogeneous information for the single -hop branch, while the multi -hop dependency is utilized to aggregate homogeneous information for the double -hop branch. It makes user and item node embedding more discriminative and integrates the different nodes' heterogeneity into the model. Experiments on several datasets manifest that NP-MGCN achieves outstanding recommendation performance than existing methods.