4.7 Article

Attentive Meta-graph Embedding for item Recommendation in heterogeneous information networks

Journal

KNOWLEDGE-BASED SYSTEMS
Volume 211, Issue -, Pages -

Publisher

ELSEVIER
DOI: 10.1016/j.knosys.2020.106524

Keywords

Recommender system; Attention mechanism; Embedding; Neural network; Heterogeneous information network

Funding

  1. National Key Research and Development Program, China [2016YFB1000101]
  2. National Natural Science Foundation of China [61702568, U1711267]
  3. Program for Guangdong Introducing Innovative and Entrepren eurial Teams, China [2017ZT07X355]
  4. China Postdoctoral Science Foundation [2019M663235]

Ask authors/readers for more resources

This paper introduces an approach called AMERec based on Attentive Meta-graph Embedding for item Recommendation in HINs to address the issues mentioned above. The method prioritizes highly similar pairwise features, differentiates each node in the meta-graph, and learns an embedding for each meta-graph. It also considers the differences between user and item pairs based on their meta-graph context and predicts ratings by capturing interaction information between users, items, and their meta-graph based context.
Heterogeneous information network (HIN) has become increasingly popular to be exploited in recommender systems, since it contains abundant semantic information to help generate better recommendations. Most conventional work employs meta-paths to model the rich semantics in the HIN. However, the meta-path as a linear structure is insufficient to express the connections. Recently, several work adopts a graph structure, i.e. meta-graph, to express the complex semantics. However, they treat the contributions of nodes in the meta-graph equally, and no explicit representations for users, items or meta-graph based context are learned in the process. To tackle the above problems, this paper proposes an Attentive Meta-graph Embedding approach for item Recommendation, called AMERec, in HINs. Firstly, we prioritize those highly similar pairwise features in the selection of meta-graph instances. Secondly, we differentiate each node in the meta-graph and learn an embedding for each meta-graph. Thirdly, we consider the differences between user and item pairs based on their meta-graph context, and learn a weight for each meta-graph by leveraging the attention mechanism. Finally, we predict the rating by capturing the low- and high-dimensional interaction information between users, items and their meta-graph based context. Comprehensive experiments on three different datasets show that the proposed method is superior to other comparative methods. (C) 2020 Elsevier B.V. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available