arrow
Return

A universal sampling method based on feature and structural comprehensive proximity measure

delete2025-08-05
delete0
PRE
AI
J
Jinhui Pang
尚成 (Cheng Shang)
Z
Ziyu Jia
H
Hao Peng
W
Weilong Wang *
X
Xiaoshuai Hao *
DOI:10.1016/j.neucom.2025.131189delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
• We propose a novel universal Feature-Structure Sampling (FSS) method based on the comprehensive proximity measure, which is plug-and-play compatible with existing GNN models, enabling accelerated computation and enhanced performance. • We utilize a graph attention network to extract feature information and first introduce Hodge score, grounded in the Hodge decomposition theorem to capture structural information. Furthermore, we theoretically demonstrate that Hodge score effectively calculates the global significance of each node within the graph structure. • To accelerate training and reduce the impact of heterogeneous edges, FSS samples the top k important nodes based on comprehensive proximity. This selection captures the majority of the neighborhood information while effectively filtering out heterogeneous data. • Experimental results show that FSS not only accelerates training speed but also mitigates the impact of heterogeneous edges, thereby enhancing model performance.
Keywords:
Feature-Structure Sampling
Graph Neural Networks
Hodge Score
Comprehensive Proximity
Node Importance

Journal

Neurocomputing cover
Neurocomputing
IF:
6.5
Papers:
2.5W
Citations:
6.5W

Organization

S
Southwestern University of Finance and Economics
Scholars:
938
Papers: 584
Citations: 56
B
Beijing Academy of Artificial Intelligence
Scholars:
126
Papers: 75
Citations: 1.6K
B
beijing institute of technology
Scholars:
5.5W
Papers: 4.0W
Citations: 63
D
d institute china–beijing
Scholars:
1
Papers: 1
Citations: 0
C
chinese academy of sciences
Scholars:
56.5W
Papers: 44.9W
Citations: 704
researcher View more organizations