Attributed Multi-order Graph Convolutional Network for Heterogeneous
Graphs
- URL: http://arxiv.org/abs/2304.06336v2
- Date: Tue, 18 Apr 2023 17:34:13 GMT
- Title: Attributed Multi-order Graph Convolutional Network for Heterogeneous
Graphs
- Authors: Zhaoliang Chen, Zhihao Wu, Luying Zhong, Claudia Plant, Shiping Wang,
Wenzhong Guo
- Abstract summary: We propose anAttributed Multi-Order Graph Convolutional Network (AMOGCN), which automatically studies meta-paths containing multi-hop neighbors.
AMOGCN gains superior semi-supervised classification performance compared with state-of-the-art competitors.
- Score: 29.618952407794783
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Heterogeneous graph neural networks aim to discover discriminative node
embeddings and relations from multi-relational networks.One challenge of
heterogeneous graph learning is the design of learnable meta-paths, which
significantly influences the quality of learned embeddings.Thus, in this paper,
we propose an Attributed Multi-Order Graph Convolutional Network (AMOGCN),
which automatically studies meta-paths containing multi-hop neighbors from an
adaptive aggregation of multi-order adjacency matrices. The proposed model
first builds different orders of adjacency matrices from manually designed node
connections. After that, an intact multi-order adjacency matrix is attached
from the automatic fusion of various orders of adjacency matrices. This process
is supervised by the node semantic information, which is extracted from the
node homophily evaluated by attributes. Eventually, we utilize a one-layer
simplifying graph convolutional network with the learned multi-order adjacency
matrix, which is equivalent to the cross-hop node information propagation with
multi-layer graph neural networks. Substantial experiments reveal that AMOGCN
gains superior semi-supervised classification performance compared with
state-of-the-art competitors.
Related papers
Err
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.