Homophily-oriented heterogeneous graph rewiring

J Guo, L Du, W Bi, Q Fu, X Ma, X Chen, S Han… - Proceedings of the …, 2023 - dl.acm.org
With the rapid development of the World Wide Web (WWW), heterogeneous graphs (HG)
have explosive growth. Recently, heterogeneous graph neural network (HGNN) has shown …

Augmentation-free graph contrastive learning with performance guarantee

H Wang, J Zhang, Q Zhu, W Huang - arxiv preprint arxiv:2204.04874, 2022 - arxiv.org
Graph contrastive learning (GCL) is the most representative and prevalent self-supervised
learning approach for graph-structured data. Despite its remarkable success, existing GCL …

Robust graph structure learning under heterophily

X **e, W Chen, Z Kang - Neural Networks, 2025 - Elsevier
A graph is a fundamental mathematical structure in characterizing relations between
different objects and has been widely used on various learning tasks. Most methods …

Graphglow: Universal and generalizable structure learning for graph neural networks

W Zhao, Q Wu, C Yang, J Yan - Proceedings of the 29th ACM SIGKDD …, 2023 - dl.acm.org
Graph structure learning is a well-established problem that aims at optimizing graph
structures adaptive to specific graph datasets to help message passing neural networks (ie …

Contrastive graph clustering with adaptive filter

X **e, W Chen, Z Kang, C Peng - Expert Systems with Applications, 2023 - Elsevier
Graph clustering has received significant attention in recent years due to the breakthrough of
graph neural networks (GNNs). However, GNNs frequently assume strong data homophily …

Homophily-related: Adaptive hybrid graph filter for multi-view graph clustering

Z Wen, Y Ling, Y Ren, T Wu, J Chen, X Pu… - Proceedings of the …, 2024 - ojs.aaai.org
Recently there is a growing focus on graph data, and multi-view graph clustering has
become a popular area of research interest. Most of the existing methods are only …

Simplified pcnet with robustness

B Li, X **e, H Lei, R Fang, Z Kang - Neural Networks, 2025 - Elsevier
Abstract Graph Neural Networks (GNNs) have garnered significant attention for their
success in learning the representation of homophilic or heterophilic graphs. However, they …

How does heterophily impact the robustness of graph neural networks? theoretical connections and practical implications

J Zhu, J **, D Loveland, MT Schaub… - Proceedings of the 28th …, 2022 - dl.acm.org
We bridge two research directions on graph neural networks (GNNs), by formalizing the
relation between heterophily of node labels (ie, connected nodes tend to have dissimilar …

How expressive are spectral-temporal graph neural networks for time series forecasting?

M **, G Shi, YF Li, Q Wen, B **ong, T Zhou… - arxiv preprint arxiv …, 2023 - arxiv.org
Spectral-temporal graph neural network is a promising abstraction underlying most time
series forecasting models that are based on graph neural networks (GNNs). However, more …

Restructuring graph for higher homophily via adaptive spectral clustering

S Li, D Kim, Q Wang - Proceedings of the AAAI Conference on Artificial …, 2023 - ojs.aaai.org
While a growing body of literature has been studying new Graph Neural Networks (GNNs)
that work on both homophilic and heterophilic graphs, little has been done on adapting …