Attributed Multi-Order Graph Convolutional Network for Heterogeneous Graphs.

Zhaoliang Chen, Zhihao Wu, Luying Zhong, Claudia Plant, Shiping Wang, Wenzhong Guo
Author Information
  1. Zhaoliang Chen: College of Computer and Data Science, Fuzhou University, Fuzhou 350116, China; Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing, Fuzhou University, Fuzhou 350116, China.
  2. Zhihao Wu: College of Computer and Data Science, Fuzhou University, Fuzhou 350116, China; Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing, Fuzhou University, Fuzhou 350116, China.
  3. Luying Zhong: College of Computer and Data Science, Fuzhou University, Fuzhou 350116, China; Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing, Fuzhou University, Fuzhou 350116, China.
  4. Claudia Plant: Faculty of Computer Science, University of Vienna, Vienna 1090, Austria; ds:UniVie, Vienna 1090, Austria.
  5. Shiping Wang: College of Computer and Data Science, Fuzhou University, Fuzhou 350116, China; Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing, Fuzhou University, Fuzhou 350116, China.
  6. Wenzhong Guo: College of Computer and Data Science, Fuzhou University, Fuzhou 350116, China; Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing, Fuzhou University, Fuzhou 350116, China. Electronic address: guowenzhong@fzu.edu.cn.

Abstract

Heterogeneous graph neural networks play a crucial role in discovering discriminative node embeddings and relations from multi-relational networks. One of the key challenges in heterogeneous graph learning lies in designing learnable meta-paths, which significantly impact the quality of learned embeddings. In this paper, we propose an Attributed Multi-Order Graph Convolutional Network (AMOGCN), which automatically explores meta-paths that involve multi-hop neighbors by aggregating multi-order adjacency matrices. The proposed model first constructs different orders of adjacency matrices from manually designed node connections. Next, AMOGCN fuses these various orders of adjacency matrices to create an intact multi-order adjacency matrix. This process is supervised by the node semantic information, which is extracted from the node homophily evaluated by attributes. Eventually, we employ 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 achieves superior semi-supervised classification performance compared with state-of-the-art competitors.

Keywords

MeSH Term

Learning
Neural Networks, Computer
Semantics

Word Cloud

Created with Highcharts 10.0.0adjacencynodegraphnetworksHeterogeneousGraphAMOGCNmulti-ordermatricesmatrixneuralembeddingsmeta-pathslearnedAttributedMulti-OrderConvolutionalNetworkordersinformationconvolutionalclassificationplaycrucialrolediscoveringdiscriminativerelationsmulti-relationalOnekeychallengesheterogeneouslearningliesdesigninglearnablesignificantlyimpactqualitypaperproposeautomaticallyexploresinvolvemulti-hopneighborsaggregatingproposedmodelfirstconstructsdifferentmanuallydesignedconnectionsNextfusesvariouscreateintactprocesssupervisedsemanticextractedhomophilyevaluatedattributesEventuallyemployone-layersimplifyingnetworkequivalentcross-hoppropagationmulti-layerSubstantialexperimentsrevealachievessuperiorsemi-supervisedperformancecomparedstate-of-the-artcompetitorsGraphsgraphsMulti-orderSemi-supervised

Similar Articles

Cited By