LeSiNN: Detecting Anomalies by Identifying Least Similar Nearest Neighbours
Open accessThe DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
We introduce the concept of Least Similar Nearest Neighbours (LeSiNN) and use LeSiNN to detect anomalies directly. Although there is an existing method which is a special case of LeSiNN, this paper is the first to clearly articulate the underlying concept, as far as we know. LeSiNN is the first ensemble method which works well with models trained using samples of one instance. LeSiNN has linear time complexity with respect to data size and the number of dimensions, and it is one of the few anomaly detectors which can apply directly to both numeric and categorical data sets. Our extensive empirical evaluation shows that LeSiNN is either competitive to or better than six state-of-the-art anomaly detectors in terms of detection accuracy and runtime.
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
LOF: 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
A Simple Generalisation of the Area Under the ROC Curve for Multiple Class Classification Problems
Hand, D. J., & Till, R. J. (2001) · Machine Learning · doi:10.1023/a:1010920819831 · Cited by 2,276 · cited 9×
“Higher AUC indicates better detection performance.”
MethodInfluentialFP-outlier: Frequent pattern based outlier detection
He, Z., Xu, X., Huang, Z., & Deng, S. (2005) · Computer Science and Information Systems · doi:10.2298/csis0501103h · Cited by 188 · cited 5×
“Following [10], FPOF employed 5 as the maximum length of itemsets by default, and we searched the minimum support threshold δ over the range 0.”
BackgroundMethodInfluential
Cited by
Deep Learning for Anomaly Detection: A Review
Pang, G., Shen, C., Cao, L., & Hengel, A. V. D. (2022) · ACM Computing Surveys · doi:10.1145/3439950 · Cited by 2,837
“, DB outliers [72, 73], k-nearest neighbor distance [125, 126], average k-nearest neighbor distance [9], relative distance [173], and random nearest neighbor distance [116, 144].”
BackgroundSelf-citationDeep Isolation Forest for Anomaly Detection
Xu, H., Pang, G., Wang, Y., & Wang, Y. (2023) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2023.3270293 · Cited by 556
Self-citationOutlier Detection: Methods, Models, and Classification
Boukerche, A., Zheng, L., & Alfandi, O. (2021) · ACM Computing Surveys · doi:10.1145/3381028 · Cited by 334
Self-Trained Deep Ordinal Regression for End-to-End Video Anomaly Detection
Pang, G., Yan, C., Shen, C., van den Hengel, A., & Bai, X. (2020) · 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr42600.2020.01219 · Cited by 257
Self-citationDeep Graph-level Anomaly Detection by Glocal Knowledge Distillation
Ma, R., Pang, G., Chen, L., & van den Hengel, A. (2022) · Proceedings of the Fifteenth ACM International Conference on Web Search and Data Mining · doi:10.1145/3488560.3498473 · Cited by 86
Self-citation
Metadata
- Authors
- Pang, G., Ting, K. M., & Albrecht, D.
- Venue
- 2015 IEEE International Conference on Data Mining Workshop (ICDMW)
- Publisher
- IEEE
- Published
- 2015-11
- Pages
- 623-630
- OpenAlex
- W2285233685
- Cited by
- 56
- References
- 3
- FWCI
- 1.14
- Type
- conference paper
- 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
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.