Streaming anomaly detection using randomized matrix sketching
The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
Data is continuously being generated from sources such as machines, network traffic, application logs, etc. Timely and accurate detection of anomalies in massive data streams has important applications such as in preventing machine failures, intrusion detection, and dynamic load balancing. In this paper, we introduce a novel (unsupervised) anomaly detection framework which can be used to detect anomalies in a streaming fashion by making only one pass over the data while utilizing limited storage. We adapt ideas from matrix sketching to maintain, in a streaming model, a set of few orthogonal vectors that form a good approximate basis for all the observed data. Using this constructed orthogonal basis, anomalies in new incoming data are detected based on a simple reconstruction error test. We theoretically prove that our algorithm compares favorably with an offline approach based on expensive global singular value decomposition (SVD) updates. Additionally, we apply ideas from randomized low-rank matrix approximations to further speedup the algorithm. The experimental results show the effectiveness and efficiency of our approach over other popular scalable anomaly detection approaches.
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
Liu, F. T., Ting, K. M., & Zhou, Z.-H. (2008) · 2008 Eighth IEEE International Conference on Data Mining · doi:10.1109/icdm.2008.17 · Cited by 6,601 · cited 1×
“Some other, more efficient techniques such as IForest [30] and Mass [36] are based on attribute-wise analysis.”
MethodLOF: identifying density-based local outliers
Breunig, M. M., Kriegel, H.-P., Ng, R. T., & Sander, J. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335388 · Cited by 5,207
Multivariate Online Anomaly Detection Using Kernel Recursive Least Squares
Ahmed, T., Coates, M., & Lakhina, A. (2007) · IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications · doi:10.1109/infcom.2007.79 · Cited by 148
Cited by
Soldani, J., & Brogi, A. (2023) · ACM Computing Surveys · doi:10.1145/3501297 · Cited by 256
“More precisely, Chen et al. [17] adapt an existing matrix sketching algorithm [29] to detect response time anomalies in services in monitored traces.”
Chen, H., Chen, P., & Yu, G. (2020) · IEEE Access · doi:10.1109/access.2020.2977464 · Cited by 36
Using Dirichlet Marked Hawkes Processes for Insider Threat Detection
Zheng, P., Yuan, S., & Wu, X. (2022) · Digital Threats: Research and Practice · doi:10.1145/3457908 · Cited by 6
“In our evaluation, we compare it with five baselines, DMHP time , DMHP type , Isolation Forest [19], Local Outlier Factor [14], and ADeMS [12].”
BackgroundMethod
Metadata
- Authors
- Huang, H., & Kasiviswanathan, S. P.
- Venue
- Proceedings of the VLDB Endowment
- Published
- 2015-11
- Volume
- 9
- Issue
- 3
- Pages
- 192-203
- ISSN
- 2150-8097 (ISSN-L)
- OpenAlex
- W2395123632
- Cited by
- 47
- References
- 3
- FWCI
- 6.57
- Type
- journal article
- Language
- en
- Open access
- closed
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.