4.7 Article

Higher-Order Attribute-Enhancing Heterogeneous Graph Neural Networks

Journal

Publisher

IEEE COMPUTER SOC
DOI: 10.1109/TKDE.2021.3074654

Keywords

Heterogeneous network; graph neural network; node embedding; higher-order; meta-path; meta-graph

Ask authors/readers for more resources

Graph neural networks (GNNs) are widely used in deep learning for graph analysis tasks. However, current methods ignore heterogeneity in real-world graphs and fail to capture content-based correlations between nodes. In this paper, we propose a novel HAE framework and a HAE(GNN) model that incorporates meta-paths and meta-graphs for rich, heterogeneous semantics and leverages self-attention mechanism for exploring content-based interactions between nodes.
Graph neural networks (GNNs) have been widely used in deep learning on graphs. They can learn effective node representations that achieve superior performances in graph analysis tasks such as node classification and node clustering. However, most methods ignore the heterogeneity in real-world graphs. Methods designed for heterogeneous graphs, on the other hand, fail to learn complex semantic representations because they only use meta-paths instead of meta-graphs. Furthermore, they cannot fully capture the content-based correlations between nodes, as they either do not use the self-attention mechanism or only use it to consider the immediate neighbors of each node, ignoring the higher-order neighbors. We propose a novel Higher-order Attribute-Enhancing (HAE) framework that enhances node embedding in a layer-by-layer manner. Under the HAE framework, we propose a Higher-order Attribute-Enhancing Graph Neural Network (HAE(GNN)) for heterogeneous network representation learning. HAE(GNN) simultaneously incorporates meta-paths and meta-graphs for rich, heterogeneous semantics, and leverages the self-attention mechanism to explore content-based nodes' interactions. The unique higher-order architecture of HAE(GNN) allows examining the first-order as well as higher-order neighborhoods. Moreover, HAE(GNN) shows good explainability as it learns the importances of different meta-paths and meta-graphs. HAE(GNN) is also memory-efficient, for it avoids per meta-path based matrix calculation. Experimental results not only show HAE(GNN)'s superior performance against the state-of-the-art methods in node classification, node clustering, and visualization, but also demonstrate its superiorities in terms of memory efficiency and explainability.

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