Abstract

Graph neural networks (GNNs), with their promising potential to learn effective graph representation, have been widely used for recommender systems, in which the given graph data contains abundant users, items, and their historical interaction information. How to obtain preferable latent representations for both users and items is one of the key issues for GNN-based recommendation. This paper develops a novel deep GNN model with multi-graph attention fusion, MAF-GNN. This framework constructs two feature graph attention modules and a multi-scale latent features module, to generate better user and item latent features from input information. Specifically, the dual-branch residual graph attention (DBRGA) module is presented to extract neighbors’ similar features from user and item graphs effectively and easily. Then multi-scale latent matrices are captured by applying non-linear transformations which are embedded to reduce the cost of dimension selection. Furthermore, a hybrid fusion graph attention (HFGA) module is designed to obtain valuable collaborative information from the user–item interaction graph, aiming to further refine the latent embedding of users and items. Finally, the whole MAF-GNN framework is optimized by a geometric factorized regularization loss. Extensive experiment results on both synthetic and real-world datasets illustrate that MAF-GNN can achieve better recommendation performance with a certain level of interpretability than some existing approaches.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.