Abstract
The remarkable progress of machine learning has led to some state-of-the-art algorithms in personalized recommendation. Previous recommendation algorithms generally learn users’ and items’ representations based on a user-item rating matrix. However, these methods only consider a user's own preference, but ignore the influence of the user's social circles. In this paper, we propose a novel recommendation algorithm, <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Self-Attentive Graph Convolution Network with Latent Group Mining and Collaborative Filtering</i> , which consists of <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Latent Group Mining</i> (LGM) module, <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Collaborative Embedding</i> (CE) module and <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Self-Attentive Graph Convolution</i> (SAGC) module. The LGM module analyzes users’ social circles by exploring their latent groups and generates group embedding for users and items. The CE module uses a graph embedding method to provide semantic collaborative embedding for users and items. The SAGC module fuses users’ (items’) collaborative embedding and group embedding by a self-attentive graph convolution network to learn their fine-grained representations for rating prediction. We conduct experiments on different real-world datasets, which validates that our algorithm outperforms the state-of-the-art algorithms.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: IEEE Transactions on Network Science and Engineering
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.