Online and Scalable Unsupervised Network Anomaly Detection Method
Open accessThe DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
Nowadays, network intrusion detectors mainly rely on knowledge databases to detect suspicious traffic. These databases have to be continuously updated which requires important human resources and time. Unsupervised network anomaly detectors overcome this issue by using “intelligent” techniques to identify anomalies without any prior knowledge. However, these systems are often very complex as they need to explore the network traffic to identify flows patterns. Therefore, they are often unable to meet real-time requirements. In this paper, we present a new online and real-time unsupervised network anomaly detection algorithm (ORUNADA). Our solution relies on a discrete time-sliding window to update continuously the feature space and an incremental grid clustering to detect rapidly the anomalies. The evaluations showed that ORUNADA can process online large network traffic while ensuring a low detection delay and good detection performance. The experiments performed on the traffic of a core network of a Spanish intermediate Internet service provider demonstrated that ORUNADA detects in less than half a second an anomaly after its occurrence. Furthermore, the results highlight that our solution outperforms in terms of true positive rate and false positive rate existing techniques reported in the literature.
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
The proof and measurement of association between two things
Spearman, C. (1904) · The American Journal of Psychology · doi:10.2307/1412159 · Cited by 8,039
Fontugne, R., Borgnat, P., Abry, P., & Fukuda, K. (2010) · Proceedings of the 6th International COnference · doi:10.1145/1921168.1921179 · Cited by 295
Cited by
Mishra, N., & Pandya, S. (2021) · IEEE Access · doi:10.1109/access.2021.3073408 · Cited by 421
A comprehensive survey on network anomaly detection
Fernandes, G., Rodrigues, J. J. P. C., Carvalho, L. F., Al-Muhtadi, J. F., & Proença, M. L. (2019) · Telecommunication Systems · doi:10.1007/s11235-018-0475-8 · Cited by 382
Hao, W., Yang, T., & Yang, Q. (2023) · IEEE Transactions on Automation Science and Engineering · doi:10.1109/tase.2021.3073396 · Cited by 143
Stacked one-class broad learning system for intrusion detection in industry 4.0
Yang, K., Shi, Y., Yu, Z., Yang, Q., Sangaiah, A. K., & Zeng, H. (2023) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2022.3157727 · Cited by 75
“Dromard [32] combined discrete-time sliding windows with incremental grid clustering to achieve online intrusion detection.”
BackgroundWorkflow-Aware Automatic Fault Diagnosis for Microservice-Based Applications With Statistics
Wang, T., Zhang, W., Xu, J., & Gu, Z. (2020) · IEEE Transactions on Network and Service Management · doi:10.1109/tnsm.2020.3022028 · Cited by 54
Metadata
- Authors
- Dromard, J., Roudiere, G., & Owezarski, P.
- Venue
- IEEE Transactions on Network and Service Management
- Published
- 2017-03
- Volume
- 14
- Issue
- 1
- Pages
- 34-47
- ISSN
- 1932-4537 (ISSN-L)
- OpenAlex
- W2555676925
- Cited by
- 142
- References
- 2
- FWCI
- 10.74
- Type
- journal article
- Language
- en
- Open access
- green
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Online and Scalable Unsupervised Network Anomaly Detection Method. https://app.cochat.ai/papers/10.1109/tnsm.2016.2627340
- The paper
- Dromard, J., Roudiere, G., & Owezarski, P. (2017). Online and Scalable Unsupervised Network Anomaly Detection Method. IEEE Transactions on Network and Service Management. https://doi.org/10.1109/tnsm.2016.2627340
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.