.png){kind=icon}
.png){kind=icon}
Return
FUSE: Fast Semi-Supervised Node Embedding Learning via Structural and Label-Aware Optimization
.png){kind=icon}
PRE
AI
S
R
A
O
S
DOI：10.1007/s10994-026-07111-0.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Graph-based learning is a cornerstone for analyzing structured data, with node classification as a central task. However, in many real-world graphs, nodes lack informative feature vectors, leaving only neighborhood connectivity and class labels as available signals. In such cases, effective classification hinges on learning node embeddings that capture structural roles and topological context. We introduce a fast semi-supervised embedding framework that jointly optimizes three complementary objectives: (i) unsupervised structure preservation via scalable modularity approximation, (ii) supervised regularization to minimize intra-class variance among labeled nodes, and (iii) semi-supervised propagation that refines unlabeled nodes through random-walk-based label spreading with attention-weighted similarity. These components are unified into a single iterative optimization scheme, yielding high-quality node embeddings. On standard benchmarks, our method consistently achieves classification accuracy at par with or superior to state-of-the-art approaches, while requiring significantly less computational cost.
Keywords:
Node representation learning
Semi-supervised learning
Node classification
Network theory
Pattern recognition
Journal
IF:
2.9
Papers:
2.6K
Citations:
3.4W
Organization
Cited Papers