DocumentCode
595186
Title
FastLOF: An Expectation-Maximization based Local Outlier detection algorithm
Author
Goldstein, Markus
Author_Institution
German Res. Center for Artificial Intell. (DFKI), Kaiserslautern, Germany
fYear
2012
fDate
11-15 Nov. 2012
Firstpage
2282
Lastpage
2285
Abstract
Unsupervised anomaly detection techniques are becoming more and more important in a variety of application domains such as network intrusion detection, fraud detection and misuse detection. Today, unsupervised anomaly detection techniques are mainly based on quadratic complexity making it almost impossible to apply them on very large data sets. In this paper, an Expectation-Maximization algorithm is proposed which computes the Local Outlier Factor (LOF) incrementally and up to 80% faster than the standard method. Another advantage of FastLOF is that intermediate results can be used by a system already during computation. Evaluation on real world data sets reveal that FastLOF performs comparable to the best outlier detection algorithms although being significantly faster.
Keywords
computational complexity; expectation-maximisation algorithm; security of data; unsupervised learning; FastLOF; expectation-maximization based local outlier detection algorithm; fraud detection; local outlier factor; machine learning; misuse detection; network intrusion detection; quadratic complexity; unsupervised anomaly detection techniques; very large data sets; Clustering algorithms; Complexity theory; Context; Expectation-maximization algorithms; Feature extraction; Intrusion detection; Training;
fLanguage
English
Publisher
ieee
Conference_Titel
Pattern Recognition (ICPR), 2012 21st International Conference on
Conference_Location
Tsukuba
ISSN
1051-4651
Print_ISBN
978-1-4673-2216-4
Type
conf
Filename
6460620
Link To Document