Homophily-oriented Heterogeneous Graph Rewiring

by   Jiayan Guo, et al.
University of the Chinese Academy of Sciences
Peking University

With the rapid development of the World Wide Web (WWW), heterogeneous graphs (HG) have explosive growth. Recently, heterogeneous graph neural network (HGNN) has shown great potential in learning on HG. Current studies of HGNN mainly focus on some HGs with strong homophily properties (nodes connected by meta-path tend to have the same labels), while few discussions are made in those that are less homophilous. Recently, there have been many works on homogeneous graphs with heterophily. However, due to heterogeneity, it is non-trivial to extend their approach to deal with HGs with heterophily. In this work, based on empirical observations, we propose a meta-path-induced metric to measure the homophily degree of a HG. We also find that current HGNNs may have degenerated performance when handling HGs with less homophilous properties. Thus it is essential to increase the generalization ability of HGNNs on non-homophilous HGs. To this end, we propose HDHGR, a homophily-oriented deep heterogeneous graph rewiring approach that modifies the HG structure to increase the performance of HGNN. We theoretically verify HDHGR. In addition, experiments on real-world HGs demonstrate the effectiveness of HDHGR, which brings at most more than 10


page 1

page 2

page 3

page 4


R-GSN: The Relation-based Graph Similar Network for Heterogeneous Graph

Heterogeneous graph is a kind of data structure widely existing in real ...

Meta-path Free Semi-supervised Learning for Heterogeneous Networks

Graph neural networks (GNNs) have been widely used in representation lea...

HAGNN: Hybrid Aggregation for Heterogeneous Graph Neural Networks

Heterogeneous graph neural networks (GNNs) have been successful in handl...

GSim: A Graph Neural Network based Relevance Measure for Heterogeneous Graphs

Heterogeneous graphs, which contain nodes and edges of multiple types, a...

Deep Generation of Heterogeneous Networks

Heterogeneous graphs are ubiquitous data structures that can inherently ...

Balanced Order Batching with Task-Oriented Graph Clustering

Balanced order batching problem (BOBP) arises from the process of wareho...

Sweeps, polytopes, oriented matroids, and allowable graphs of permutations

A sweep of a point configuration is any ordered partition induced by a l...

Please sign up or login with your details

Forgot password? Click here to reset