Enhancing Homophily-Heterophily Separation: Relation-Aware Learning in Heterogeneous Graphs

• URL: http://arxiv.org/abs/2506.20980v1
• Date: Thu, 26 Jun 2025 03:54:06 GMT
• Title: Enhancing Homophily-Heterophily Separation: Relation-Aware Learning in Heterogeneous Graphs
• Authors: Ziyu Zheng, Yaming Yang, Ziyu Guan, Wei Zhao, Weigang Lu,
• Abstract summary: We propose Relation-Aware Separation of Homophily and Heterophily (RASH), a novel contrastive learning framework.<n>RASH explicitly models high-order semantics of heterogeneous interactions and adaptively separates homophilic and heterophilic patterns.<n>A multi-relation contrastive loss is designed to align heterogeneous and homophilic/heterophilic views by maximizing mutual information.
• Score: 14.452589880736523
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Real-world networks usually have a property of node heterophily, that is, the connected nodes usually have different features or different labels. This heterophily issue has been extensively studied in homogeneous graphs but remains under-explored in heterogeneous graphs, where there are multiple types of nodes and edges. Capturing node heterophily in heterogeneous graphs is very challenging since both node/edge heterogeneity and node heterophily should be carefully taken into consideration. Existing methods typically convert heterogeneous graphs into homogeneous ones to learn node heterophily, which will inevitably lose the potential heterophily conveyed by heterogeneous relations. To bridge this gap, we propose Relation-Aware Separation of Homophily and Heterophily (RASH), a novel contrastive learning framework that explicitly models high-order semantics of heterogeneous interactions and adaptively separates homophilic and heterophilic patterns. Particularly, RASH introduces dual heterogeneous hypergraphs to encode multi-relational bipartite subgraphs and dynamically constructs homophilic graphs and heterophilic graphs based on relation importance. A multi-relation contrastive loss is designed to align heterogeneous and homophilic/heterophilic views by maximizing mutual information. In this way, RASH simultaneously resolves the challenges of heterogeneity and heterophily in heterogeneous graphs. Extensive experiments on benchmark datasets demonstrate the effectiveness of RASH across various downstream tasks. The code is available at: https://github.com/zhengziyu77/RASH.

Related papers

• Homophily-aware Heterogeneous Graph Contrastive Learning [23.38883104104888]
  We propose a novel heterogeneous graph contrastive learning framework, termed HGMS, to learn homophilous node representations.<n> Specifically, we design a heterogeneous edge dropping augmentation strategy that enhances the homophily of augmented views.<n>In practice, we develop two approaches to solve the self-expressive matrix.
  arXiv  Detail & Related papers  (2025-01-15T02:56:50Z)
• Addressing Graph Heterogeneity and Heterophily from A Spectral Perspective [46.37860909753809]
  Heterogeneity refers to a graph with multiple types of nodes or edges, while heterophily refers to the fact that connected nodes are more likely to have dissimilar attributes or labels.<n>We propose a Heterogeneous Heterophilic Spectral Graph Neural Network (H2SGNN), which employs two modules: local independent filtering and global hybrid filtering.<n> Extensive experiments are conducted on four datasets to validate the effectiveness of the proposed H2SGNN.
  arXiv  Detail & Related papers  (2024-10-17T09:23:53Z)
• SiMilarity-Enhanced Homophily for Multi-View Heterophilous Graph Clustering [18.108753344903473]
  We propose a novel SiMilarity-enhanced Homophily for Multi-view Heterophilous Graph Clustering (SMHGC) approach. The state-of-the-art experimental results on both multi-view heterophilous and homophilous datasets collectively demonstrate the strong capacity of similarity for unsupervised multi-view heterophilous graph learning.
  arXiv  Detail & Related papers  (2024-10-04T16:55:35Z)
• The Heterophilic Graph Learning Handbook: Benchmarks, Models, Theoretical Analysis, Applications and Challenges [101.83124435649358]
  Homophily principle, ie nodes with the same labels or similar attributes are more likely to be connected. Recent work has identified a non-trivial set of datasets where GNN's performance compared to the NN's is not satisfactory.
  arXiv  Detail & Related papers  (2024-07-12T18:04:32Z)
• Generation is better than Modification: Combating High Class Homophily Variance in Graph Anomaly Detection [51.11833609431406]
  Homophily distribution differences between different classes are significantly greater than those in homophilic and heterophilic graphs. We introduce a new metric called Class Homophily Variance, which quantitatively describes this phenomenon. To mitigate its impact, we propose a novel GNN model named Homophily Edge Generation Graph Neural Network (HedGe)
  arXiv  Detail & Related papers  (2024-03-15T14:26:53Z)
• Hetero$^2$Net: Heterophily-aware Representation Learning on Heterogenerous Graphs [38.858702539146385]
  We present Hetero$2$Net, a heterophily-aware HGNN that incorporates both masked metapath prediction and masked label prediction tasks. We evaluate the performance of Hetero$2$Net on five real-world heterogeneous graph benchmarks with varying levels of heterophily.
  arXiv  Detail & Related papers  (2023-10-18T02:19:12Z)
• Finding the Missing-half: Graph Complementary Learning for Homophily-prone and Heterophily-prone Graphs [48.79929516665371]
  Graphs with homophily-prone edges tend to connect nodes with the same class. Heterophily-prone edges tend to build relationships between nodes with different classes. Existing GNNs only take the original graph during training.
  arXiv  Detail & Related papers  (2023-06-13T08:06:10Z)
• Demystifying Structural Disparity in Graph Neural Networks: Can One Size Fit All? [61.35457647107439]
  Most real-world homophilic and heterophilic graphs are comprised of a mixture of nodes in both homophilic and heterophilic structural patterns. We provide evidence that Graph Neural Networks(GNNs) on node classification typically perform admirably on homophilic nodes. We then propose a rigorous, non-i.i.d PAC-Bayesian generalization bound for GNNs, revealing reasons for the performance disparity.
  arXiv  Detail & Related papers  (2023-06-02T07:46:20Z)
• Geometry Contrastive Learning on Heterogeneous Graphs [50.58523799455101]
  This paper proposes a novel self-supervised learning method, termed as Geometry Contrastive Learning (GCL) GCL views a heterogeneous graph from Euclidean and hyperbolic perspective simultaneously, aiming to make a strong merger of the ability of modeling rich semantics and complex structures. Extensive experiments on four benchmarks data sets show that the proposed approach outperforms the strong baselines.
  arXiv  Detail & Related papers  (2022-06-25T03:54:53Z)
• Heterogeneous Graph Neural Networks using Self-supervised Reciprocally Contrastive Learning [102.9138736545956]
  Heterogeneous graph neural network (HGNN) is a very popular technique for the modeling and analysis of heterogeneous graphs. We develop for the first time a novel and robust heterogeneous graph contrastive learning approach, namely HGCL, which introduces two views on respective guidance of node attributes and graph topologies. In this new approach, we adopt distinct but most suitable attribute and topology fusion mechanisms in the two views, which are conducive to mining relevant information in attributes and topologies separately.
  arXiv  Detail & Related papers  (2022-04-30T12:57:02Z)
• Powerful Graph Convolutioal Networks with Adaptive Propagation Mechanism for Homophily and Heterophily [38.50800951799888]
  Graph Convolutional Networks (GCNs) have been widely applied in various fields due to their significant power on processing graph-structured data. Existing methods deal with heterophily by mainly aggregating higher-order neighborhoods or combing the immediate representations. This paper proposes a novel propagation mechanism, which can automatically change the propagation and aggregation process according to homophily or heterophily.
  arXiv  Detail & Related papers  (2021-12-27T08:19:23Z)
• Learning on heterogeneous graphs using high-order relations [37.64632406923687]
  We propose an approach for learning on heterogeneous graphs without using meta-paths. We decompose a heterogeneous graph into different homogeneous relation-type graphs, which are then combined to create higher-order relation-type representations.
  arXiv  Detail & Related papers  (2021-03-29T12:02:47Z)

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.