AIRC: Attentive Implicit Relation Recommendation Incorporating Content Information for Bipartite Graphs

• Main Authors: Xintao Ma, Liyan Dong, Yuequn Wang, Yongli Li, Minghui Sun
• Format: Article
• Language: English
• Published: MDPI AG 2020-11-01
• Series: Mathematics
• Subjects: recommendation system; bipartite graphs; graph representation learning; matrix completion
• Online Access: https://www.mdpi.com/2227-7390/8/12/2132

With users being exposed to the growing volume of online information, the recommendation system aiming at mining the important or interesting information is becoming a modern research topic. One approach of recommendation is to integrate the graph neural network with deep learning algorithms. However, some of them are not tailored for bipartite graphs, which is a unique type of heterogeneous graph having two entity types. Others, though customized, neglect the importance of implicit relation and content information. In this paper, we propose the attentive implicit relation recommendation incorporating content information (AIRC) framework that is designed for bipartite graphs based on the GC–MC algorithm. First, through reconstructing the bipartite graphs, we obtain the implicit relation graphs. Then we analyze the content information of users and items with a CNN process, so that each user and item has its feature-tailored embeddings. Besides, we expand the GC–MC algorithms by adding a graph attention mechanism layer, which handles the implicit relation graph by highlighting important features and neighbors. Therefore, our framework takes into consideration both the implicit relation and content information. Finally, we test our framework on Movielens dataset and the results show that our framework performs better than other state-of-art recommendation algorithms.