Enhance Graph-Based Intrusion Detection in Optical Networks via Pseudo-Metapaths

Gang Qu (), Haochun Jin, Liang Zhang, Minhui Ge, Xin Wu, Haoran Li and Jian Xu
Additional contact information
Gang Qu: State Grid Corporation of China East China Branch, Shanghai 200120, China
Haochun Jin: State Grid Corporation of China East China Branch, Shanghai 200120, China
Liang Zhang: State Grid Corporation of China East China Branch, Shanghai 200120, China
Minhui Ge: State Grid Corporation of China East China Branch, Shanghai 200120, China
Xin Wu: State Grid Corporation of China East China Branch, Shanghai 200120, China
Haoran Li: Software College, Northeastern University, Shenyang 110169, China
Jian Xu: Software College, Northeastern University, Shenyang 110169, China

Mathematics, 2025, vol. 13, issue 21, 1-26

Abstract: Deep learning on graphs has emerged as a leading paradigm for intrusion detection, yet its performance in optical networks is often hindered by sparse labeled data and severe class imbalance, leading to an “under-reaching” issue where supervision signals fail to propagate effectively. To address this, we introduce Pseudo-Metapaths: dynamic, semantically aware propagation routes discovered on-the-fly. Our framework first leverages Beta-Wavelet spectral filters for robust, frequency-aware node representations. It then transforms the graph into a dynamic heterogeneous structure using the model’s own pseudo-labels to define transient ‘normal’ or ‘anomaly’ node types. This enables an attention mechanism to learn the importance of different Pseudo-Metapaths (e.g., Anomaly–Normal–Anomaly), guiding supervision signals along the most informative routes. Extensive experiments on four benchmark datasets demonstrate quantitative superiority. Our model achieves state-of-the-art F1-scores, outperforming a strong spectral GNN backbone by up to 3.15%. Ablation studies further confirm that our Pseudo-Metapath module is critical, as its removal causes F1-scores to drop by as much as 7.12%, directly validating its effectiveness against the under-reaching problem.

Keywords: graph neural networks; intrusion detection; heterogeneous graph (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/13/21/3432/pdf (application/pdf)
https://www.mdpi.com/2227-7390/13/21/3432/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:13:y:2025:i:21:p:3432-:d:1781162

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().