DocumentCode
3739212
Title
LeSiNN: Detecting Anomalies by Identifying Least Similar Nearest Neighbours
Author
Guansong Pang;Kai Ming Ting;David Albrecht
Author_Institution
Adv. Analytics Inst., Univ. of Technol. Sydney, Sydney, NSW, Australia
fYear
2015
Firstpage
623
Lastpage
630
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.
Keywords
"Time complexity","Detectors","Data models","Australia","Numerical models","Indexing"
Publisher
ieee
Conference_Titel
Data Mining Workshop (ICDMW), 2015 IEEE International Conference on
Electronic_ISBN
2375-9259
Type
conf
DOI
10.1109/ICDMW.2015.62
Filename
7395725
Link To Document