paper-with-me

홈 › Papers

What Is Missing In Homophily? Disentangling Graph Homophily For Graph Neural Networks

2024-06-27 · Yilun Zheng, Sitao Luan, Lihui Chen

Graph homophily refers to the phenomenon that connected nodes tend to share similar characteristics. Understanding this concept and its related metrics is crucial for designing effective Graph Neural Networks (GNNs). The most widely used homophily metrics, such as edge or node homophily, quantify such "similarity" as label consistency across the graph topology. These metrics are believed to be able to reflect the performance of GNNs, especially on node-level tasks. However, many recent studies have empirically demonstrated that the performance of GNNs does not always align with homophily metrics, and how homophily influences GNNs still remains unclear and controversial. Then, a crucial question arises: What is missing in our current understanding of homophily? To figure out the missing part, in this paper, we disentangle the graph homophily into $3$ aspects: label, structural, and feature homophily, providing a more comprehensive understanding of GNN performance. To investigate their synergy, we propose a Contextual Stochastic Block Model with $3$ types of Homophily (CSBM-3H), where the topology and feature generation are controlled by the $3$ metrics. Based on the theoretical analysis of CSBM-3H, we derive a new composite metric, named Tri-Hom, that considers all $3$ aspects and overcomes the limitations of conventional homophily metrics. The theoretical conclusions and the effectiveness of Tri-Hom have been verified through synthetic experiments on CSBM-3H. In addition, we conduct experiments on $31$ real-world benchmark datasets and calculate the correlations between homophily metrics and model performance. Tri-Hom has significantly higher correlation values than $17$ existing metrics that only focus on a single homophily aspect, demonstrating its superiority and the importance of homophily synergy. Our code is available at \url{https://github.com/zylMozart/Disentangle_GraphHom}.

📄 PDF Abstract BibTeX arXiv:2406.18854

Code (1)

zylmozart/disentangle_graphhom 공식 구현 pytorch

Tasks

Stochastic Block Model

Methods 이 논문이 사용한 방법론

ALIGN In the ALIGN method, visual and language representations are jointly trained from noisy image alt-text data. The image and text encoders are learned via contrastive loss…
Focus 설명 없음

Similar Papers 제목 키워드 기반

Finding the Missing-half: Graph Complementary Learning for Homophily-prone and Heterophily-prone Graphs

2023-06-13 · Yizhen Zheng, He Zhang, Vincent CS Lee, Yu Zheng 외

Real-world graphs generally have only one kind of tendency in their connections. These connections are either homophily-prone or heterophily-prone. While graphs with homophily-prone edges tend to connect nodes with the s…

FedSPA: Generalizable Federated Graph Learning under Homophily Heterogeneity

2025-01-01 · CVPR 2025 1 · Zihan Tan, Guancheng Wan, Wenke Huang, He Li 외

Federated Graph Learning (FGL) has emerged as a solution to address real-world privacy concerns and data silos in graph learning, which relies on Graph Neural Networks (GNNs). Nevertheless, the homophily level discre…

Graph Learning

Revisiting Graph Homophily Measures

2024-12-12 · Mikhail Mironov, Liudmila Prokhorenkova

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 …

All

Homophily Enhanced Graph Domain Adaptation

2025-05-26 · Ruiyi Fang, Bingheng Li, Jingyu Zhao, Ruizhi Pu 외

Graph Domain Adaptation (GDA) transfers knowledge from labeled source graphs to unlabeled target graphs, addressing the challenge of label scarcity. In this paper, we highlight the significance of graph homophily, a pivo…

Domain AdaptationGRAPH DOMAIN ADAPTATION

On Performance Discrepancies Across Local Homophily Levels in Graph Neural Networks

2023-06-08 · Donald Loveland, Jiong Zhu, Mark Heimann, Benjamin Fish 외

Graph Neural Network (GNN) research has highlighted a relationship between high homophily (i.e., the tendency of nodes of the same class to connect) and strong predictive performance in node classification. However, rece…

Graph Neural NetworkNode Classification