SERM integrates topology-aware graph propagation with masked self-supervised reconstruction, a masked self-supervised framework for network-level structural representation learning that captures useful structural information and remains applicable across several network-level evaluation settings.
Abstract
Complex networks are widely used to represent interactions in communication systems, biological systems, and large-scale infrastructure. Learning informative network-level representations is important for network analysis, structural similarity retrieval, and characterization of network properties. Existing representation learning methods, however, may have limited ability to jointly capture multi-hop topological dependencies and node attribute information, particularly when network observations are incomplete. This work presents SERM, a masked self-supervised framework for network-level structural representation learning. SERM integrates topology-aware graph propagation with masked self-supervised reconstruction. Node-level structural attributes are propagated according to the normalized network topology, enabling attribute information and multi-hop neighborhood context to interact directly within the encoder. Masked reconstruction then provides the self-supervised learning objective by requiring the model to recover hidden node attributes from the available attributes and graph context. During training, a subset of node attributes is masked and reconstructed from the available attributes and graph context, encouraging the encoder to exploit information from both sources without requiring external labels. The resulting node representations are aggregated into fixed-dimensional network-level embeddings for downstream analysis. Experiments on complex-network datasets evaluate the learned representations through network retrieval, structural property prediction, cross-dataset evaluation, robustness analysis, and ablation studies. The results provide empirical evidence that the proposed framework captures useful structural information and remains applicable across several network-level evaluation settings.
Results indicate that adaptive multi-order graph fusion can provide effective structural guidance for structure-preserving unsupervised representation learning.
Can-Yu Zhang, Yun-Jing Zhang, Jia-Wen Sun et al.· Applied Sciences· 0 citations
Graph neural networks have shown strong potential for learning structural representations of biological networks. However, repeated message passing may blur local structural signals that are relevant for motif- and graphlet-based analysis. This paper investigates multilabel graphlet classification in protein–protein in...
Lidija Kunst, Friedhelm Schwenker, H. Kestler· Entropy· 0 citations
Identifying influential nodes is a fundamental task in complex network analysis, with applications in epidemic control, information diffusion, and network robustness. Existing centrality-based and learning-based methods often provide limited integration of structural information across different network scales. To addr...
Rihab Boukheche, Mohammed Lalou, Nardjes Bouchemal· 0 citations
It is indicated that structural information remains important for link prediction in contemporary learning-based models and future work will continue to improve the scalability, robustness, temporal adaptation and interpretability of link prediction models for large-scale, dynamic real-world networks.
Кай Ли· Theoretical and Natural Scie...· 0 citations
A community detection via graph attention auto-encoders and decoders with non-negative matrix factorization (GA-NMF) with self-training module in social networks achieves deep fusion and efficient utilization of graph information for community division.
Peng Zhang, Xian-Yong Li, Jun-Yu Nie et al.· Journal of Supercomputing· 0 citations
A Multi-scale Attention-based Dynamic Graph Network (MADGN) integrating structure-aware modeling and hierarchical attention is proposed, which outperforms state-of-the-art baselines on dynamic link prediction, dynamic new link prediction, and node classification tasks.