Revisiting Graph Homophily Measures

• URL: http://arxiv.org/abs/2412.09663v1
• Date: Thu, 12 Dec 2024 14:54:56 GMT
• Title: Revisiting Graph Homophily Measures
• Abstract summary: Homophily is a graph property describing the tendency of edges to connect similar nodes.<n>Previous works on graph homophily suggested several properties desirable for a good homophily measure.<n>Our paper introduces a new homophily measure - unbiased homophily.
• Score: 18.497863598167257
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Homophily is a graph property describing the tendency of edges to connect similar nodes. There are several measures used for assessing homophily but all are known to have certain drawbacks: in particular, they cannot be reliably used for comparing datasets with varying numbers of classes and class size balance. To show this, previous works on graph homophily suggested several properties desirable for a good homophily measure, also noting that no existing homophily measure has all these properties. Our paper addresses this issue by introducing a new homophily measure - unbiased homophily - that has all the desirable properties and thus can be reliably used across datasets with different label distributions. The proposed measure is suitable for undirected (and possibly weighted) graphs. We show both theoretically and via empirical examples that the existing homophily measures have serious drawbacks while unbiased homophily has a desirable behavior for the considered scenarios. Finally, when it comes to directed graphs, we prove that some desirable properties contradict each other and thus a measure satisfying all of them cannot exist.

Related papers

• Modeling Heterophily in Multiplex Graphs: An Adaptive Approach for Node Classification [6.703619231011383]
  Existing graph models often assume homophily, where connected nodes tend to belong to the same class or share similar attributes.<n>We propose methodname, a novel method for node classification in multiplex graphs that adapts to both homophilic and heterophilic dimensions.<n>methodname captures the complex interplay of homophilic and heterophilic interactions in multiplex graphs, and tends to yield improved node classification performance compared to state-of-the-art methods.
  arXiv  Detail & Related papers  (2026-05-12T19:52:27Z)
• Uncertainty Estimation for Heterophilic Graphs Through the Lens of Information Theory [43.50142477752392]
  We develop a suitable analog to data processing inequality to quantify information throughout the model's layers.<n>We empirically confirm this with a simple post-hoc density estimator on the joint node embedding space.
  arXiv  Detail & Related papers  (2025-05-28T09:18:01Z)
• 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)
• What Is Missing In Homophily? Disentangling Graph Homophily For Graph Neural Networks [3.1227658238819855]
  Graph homophily refers to the phenomenon that connected nodes tend to share similar characteristics. The most widely used homophily metrics, such as edge or node homophily, quantify such "similarity" How homophily influences Graph Neural Networks (GNNs) still remains unclear and controversial.
  arXiv  Detail & Related papers  (2024-06-27T02:48:33Z)
• 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)
• Provable Filter for Real-world Graph Clustering [11.7278692671308]
  A principled way to handle practical graphs is urgently needed. We construct two graphs that are highly homophilic and heterophilic, respectively. We validate our approach through extensive experiments on both homophilic and heterophilic graphs.
  arXiv  Detail & Related papers  (2024-03-06T12:37:49Z)
• 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)
• Single-Pass Contrastive Learning Can Work for Both Homophilic and Heterophilic Graph [60.28340453547902]
  Graph contrastive learning (GCL) techniques typically require two forward passes for a single instance to construct the contrastive loss. Existing GCL approaches fail to provide strong performance guarantees. We implement the Single-Pass Graph Contrastive Learning method (SP-GCL) Empirically, the features learned by the SP-GCL can match or outperform existing strong baselines with significantly less computational overhead.
  arXiv  Detail & Related papers  (2022-11-20T07:18:56Z)
• Characterizing Graph Datasets for Node Classification: Homophily-Heterophily Dichotomy and Beyond [36.5554915218563]
  Homophily is a graph property describing the tendency of edges to connect similar nodes; the opposite is called heterophily. There is no universally agreed-upon measure of homophily in the literature. We show that commonly used homophily measures have critical drawbacks preventing the comparison of homophily levels across different datasets.
  arXiv  Detail & Related papers  (2022-09-13T17:28:25Z)
• Is Homophily a Necessity for Graph Neural Networks? [50.959340355849896]
  Graph neural networks (GNNs) have shown great prowess in learning representations suitable for numerous graph-based machine learning tasks. GNNs are widely believed to work well due to the homophily assumption ("like attracts like"), and fail to generalize to heterophilous graphs where dissimilar nodes connect. Recent works design new architectures to overcome such heterophily-related limitations, citing poor baseline performance and new architecture improvements on a few heterophilous graph benchmark datasets as evidence for this notion. In our experiments, we empirically find that standard graph convolutional networks (GCNs) can actually achieve better performance than
  arXiv  Detail & Related papers  (2021-06-11T02:44:00Z)
• New Benchmarks for Learning on Non-Homophilous Graphs [20.082182515715182]
  We present a series of improved graph datasets with node label relationships that do not satisfy the homophily principle. We also introduce a new measure of the presence or absence of homophily that is better suited than existing measures in different regimes.
  arXiv  Detail & Related papers  (2021-04-03T13:45:06Z)

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.