Schema-Aware Deep Graph Convolutional Networks for Heterogeneous Graphs
Saurav Manchanda, Da Zheng, George Karypis

TL;DR
This paper introduces DHGCN, a schema-aware deep graph convolutional network for heterogeneous graphs that effectively captures multi-hop information while mitigating over-smoothing, leading to improved performance.
Contribution
The paper proposes a novel hierarchical GCN framework that leverages graph schema and metapaths to enhance message passing in heterogeneous graphs.
Findings
Demonstrates performance improvements over existing methods on real datasets.
Effectively captures multi-hop neighbor information without over-smoothing.
Validates design choices through experiments on synthetic and real data.
Abstract
Graph convolutional network (GCN) based approaches have achieved significant progress for solving complex, graph-structured problems. GCNs incorporate the graph structure information and the node (or edge) features through message passing and computes 'deep' node representations. Despite significant progress in the field, designing GCN architectures for heterogeneous graphs still remains an open challenge. Due to the schema of a heterogeneous graph, useful information may reside multiple hops away. A key question is how to perform message passing to incorporate information of neighbors multiple hops away while avoiding the well-known over-smoothing problem in GCNs. To address this question, we propose our GCN framework 'Deep Heterogeneous Graph Convolutional Network (DHGCN)', which takes advantage of the schema of a heterogeneous graph and uses a hierarchical approach to effectively…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsGraph Convolutional Network
