From Data to Decision: A Multi-Stage Framework for Class Imbalance Mitigation in Optical Network Failure Analysis
Not on the map. Why?
Abstract (arXiv)
Machine learning-based failure management in optical networks has gained significant attention in recent years. However, severe class imbalance, where normal instances vastly outnumber failure cases, remains a considerable challenge. While pre- and in-processing techniques have been widely studied, post-processing methods are largely unexplored. In this work, we present a direct comparison of pre-, in-, and post-processing approaches for class imbalance mitigation in failure detection and identification using an experimental dataset. For failure detection, post-processing methods-particularly Threshold Adjustment-achieve the highest F1 score improvement (up to 15.3%), while Random Under-Sampling provides the fastest inference. In failure identification, GenAI methods deliver the most substantial performance gains (up to 24.2%), whereas post-processing shows limited impact in multi-class settings. When class overlap is present and latency is critical, over-sampling methods such as the SMOTE are most effective; without latency constraints, Meta-Learning yields the best results. In low-overlap scenarios, Generative AI approaches provide the highest performance with minimal inference time.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 6 of its 57 references that are in the map. First posted on arXiv 25 Aug 2025.
Builds on
6 of 57 references.
References · 6
- 2019Modeling Tabular data using Conditional GANcited by 699
- 2016Tutorial on Variational Autoencoderscited by 409
- 2022Bias Mitigation for Machine Learning Classifiers: A Comprehensive Surveycited by 125
- 2023Advances and Challenges in Meta-Learning: A Technical Reviewcited by 65
- 2020k-Nearest Neighbour Classifiers: 2nd Edition (with Python examples)cited by 56
- 2022A Review of Machine Learning-based Failure Management in Optical Networkscited by 4
Built on by
Citing papers per year: 2026: 1.
1 paper.