Self-Taught Anomaly Detection With Hybrid Unsupervised/Supervised Machine Learning in Optical Networks
Open accessThe DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
This paper proposes a self-taught anomaly detection framework for optical networks. The proposed framework makes use of a hybrid unsupervised and supervised machine learning scheme. First, it employs an unsupervised data clustering module (DCM) to analyze the patterns of monitoring data. The DCM enables a self-learning capability that eliminates the requirement of prior knowledge of abnormal network behaviors and therefore can potentially detect unforeseen anomalies. Second, we introduce a self-taught mechanism that transfers the patterns learned by the DCM to a supervised data regression and classification module (DRCM). The DRCM, whose complexity is mainly related to the scale of the applied supervised learning model, can potentially facilitate more scalable and time-efficient online anomaly detection by avoiding excessively traversing the original dataset. We designed the DCM and DRCM based on the density-based clustering algorithm and the deep neural network structure, respectively. Evaluations with experimental data from two use cases (i.e., single-point detection and end-to-end detection) demonstrate that up to 99% anomaly detection accuracy can be achieved with a false positive rate below 1%.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Algorithm AS 136: A K-Means Clustering Algorithm
Hartigan, J. A., & Wong, M. A. (1979) · Applied Statistics · doi:10.2307/2346830 · Cited by 14,523
Research works printed but not linked: 35
- pedregosa, 2011, Scikit-learn: Machine learning in python, J Mach Learn Res, 12, 2825
- 10.1364/JOCN.10.000162 · DOI
- 10.1109/COMST.2014.2336610 · DOI · Paper page
- ester, 0, A density-based algorithm for discovering clusters in large spatial databases with noise, Proc Int'l Conf Knowledge Discovery and Data Mining, 226
- 10.1364/OFC.2019.M2A.2 · doi:10.1364/ofc.2019.m2a.2
- 10.1364/OFC.2018.Th4D.7 · doi:10.1364/ofc.2018.th4d.7
- 10.1109/INFOCOM.2014.6847918 · DOI · Paper page
- 10.1364/JOCN.11.0000A1 · DOI
- 10.1109/JLT.2012.2227683 · DOI · Paper page
- 10.1109/JLT.2013.2296781 · doi:10.1109/jlt.2013.2296781
- 10.1364/JOCN.9.0000A9 · doi:10.1364/jocn.9.0000a9
- 10.1109/COMST.2018.2880039 · DOI · Paper page
- 10.1109/MCOM.2018.1701191 · DOI
- 10.1109/JLT.2017.2660540 · doi:10.1109/jlt.2017.2660540
- 10.1109/ECOC.2017.8346218 · doi:10.1109/ecoc.2017.8346218
- 10.1364/JOCN.10.000D29 · doi:10.1364/jocn.10.000d29
- 10.1109/ECOC.2018.8535185 · DOI
- 10.1109/MCOM.2006.248169 · doi:10.1109/mcom.2006.248169
- 10.1109/TKDE.2010.235 · DOI · Paper page
- 10.1109/JSAC.2005.852182 · DOI · Paper page
- 10.1109/JLT.2015.2456052 · doi:10.1109/jlt.2015.2456052
- 10.1109/JLT.2018.2795345 · DOI
- 10.1109/JLT.2015.2456152 · doi:10.1109/jlt.2015.2456152
- 10.1364/JOCN.5.000836 · doi:10.1364/jocn.5.000836
- 10.1364/JOCN.10.000344 · doi:10.1364/jocn.10.000344
- 10.1109/MNET.2015.7293303 · DOI · Paper page
- 10.1109/JLT.2013.2294389 · doi:10.1109/jlt.2013.2294389
- 10.1109/MNET.2004.1276610 · doi:10.1109/mnet.2004.1276610
- 10.1109/JLT.2018.2864676 · DOI
- 10.1109/JLT.2017.2747223 · doi:10.1109/jlt.2017.2747223
- 10.1364/OFC.2018.W4F.2 · doi:10.1364/ofc.2018.w4f.2
- 10.1364/OFC.2018.M3A.5 · DOI
- 10.1364/JOCN.10.000A27 · DOI
- 10.1109/ECOC.2018.8535155 · DOI
- 10.1109/JLT.2017.2781540 · DOI · Paper page
Cited by
Machine Learning for Anomaly Detection: A Systematic Review
Nassif, A. B., Talib, M. A., Nasir, Q., & Dakalbab, F. M. (2021) · IEEE Access · doi:10.1109/access.2021.3083060 · Cited by 748
Natalino, C., Schiano, M., Di Giglio, A., Wosinska, L., & Furdek, M. (2019) · Journal of Lightwave Technology · doi:10.1109/jlt.2019.2923558 · Cited by 63
“Another application of ML is the detection, identification and localization of soft-failures [7], [8], [27], [28].”
BackgroundCause-aware failure detection using an interpretable XGBoost for optical networks
Zhang, C., Wang, D., Wang, L., Guan, L., Yang, H., Zhang, Z., Chen, X., & Zhang, M. (2021) · Optics Express · doi:10.1364/oe.436293 · Cited by 53
Self-citationMalik, G., Dipto, I. C., Masood, M. U., Mohamed, M. C., Straullu, S., Bhyri, S. K., Galimberti, G. M., Napoli, A., Pedro, J., Wakim, W., et al. (2025) · AI · doi:10.3390/ai6070131 · Cited by 10
Metadata
- Authors
- Chen, X., Li, B., Proietti, R., Zhu, Z., & Yoo, S. J. B.
- Venue
- Journal of Lightwave Technology
- Published
- 2019-04-01
- Volume
- 37
- Issue
- 7
- Pages
- 1742-1749
- ISSN
- 0733-8724 (ISSN-L)
- 1558-2213
- OpenAlex
- W2919221886
- Cited by
- 107
- References
- 1
- FWCI
- 5.46
- Type
- journal article
- Language
- en
- Open access
- green
- Licence
- Funders
- U.S. Department of Energy (DE-SC0016700)
- National Science Foundation ICE-T:RC (1836921)
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.