Papers › Enhancing Intra-class Information Extraction for Heterophilous Graphs: One Neural...

Enhancing Intra-class Information Extraction for Heterophilous Graphs: One Neural Architecture Search Approach

20 Nov 2022arXiv:2211.10990archive 2025-07-28

Lanning Wei, Zhiqiang He, Huan Zhao, Quanming Yao

In recent years, Graph Neural Networks (GNNs) have been popular in graph representation learning which assumes the homophily property, i.e., the connected nodes have the same label or have similar features. However, they may fail to generalize into the heterophilous graphs which in the low/medium level of homophily. Existing methods tend to address this problem by enhancing the intra-class information extraction, i.e., either by designing better GNNs to improve the model effectiveness, or re-designing the graph structures to incorporate more potential intra-class nodes from distant hops. Despite the success, we observe two aspects that can be further improved: (a) enhancing the ego feature information extraction from node itself which is more reliable in extracting the intra-class information; (b) designing node-wise GNNs can better adapt to the nodes with different homophily ratios. In this paper, we propose a novel method IIE-GNN (Intra-class Information Enhanced Graph Neural Networks) to achieve two improvements. A unified framework is proposed based on the literature, in which the intra-class information from the node itself and neighbors can be extracted based on seven carefully designed blocks. With the help of neural architecture search (NAS), we propose a novel search space based on the framework, and then provide an architecture predictor to design GNNs for each node. We further conduct experiments to show that IIE-GNN can improve the model performance by designing node-wise GNNs to enhance intra-class information extraction.

PaperPDF

Code

No code repository is listed for this paper in the archive or in Syntology's graph.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

Graph Representation LearningNeural Architecture SearchNode ClassificationRepresentation Learning

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Node Classification Actor IIE-GNN Accuracy 39.91 ± 2.41 #4 of 62 Archive leaderboard report
Node Classification Chameleon IIE-GNN Accuracy 72.13±2.11 #23 of 61 Archive leaderboard report
Node Classification Squirrel IIE-GNN Accuracy 57.32±1.89 #31 of 59 Archive leaderboard report
Node Classification Texas IIE-GNN Accuracy 85.84±4.23 #26 of 62 Archive leaderboard report
Node Classification arXiv-year IIE-GNN Accuracy 51.59±0.24 #10 of 12 Archive leaderboard report

Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.

Methods

fail

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections