Anomaly Detection by Combining Decision Trees and Parametric Densities

Matthias Reif, Markus Goldstein, Armin Stahl, Thomas Breuel
Pattern Recognition, 2008. ICPR 2008., Tampa, FL, USA, IEEE, 12/2008

Abstract:

In this paper a modified decision tree algorithm for anomaly detection is presented. During the tree building process, densities for the outlier class are used directly in the split point determination algorithm. No artificial counter-examples have to be sampled from the unknown class, which yields to more precise decision boundaries and a deterministic classification result. Furthermore, the prior of the outlier class can be used to adjust the sensitivity of the anomaly detector. The proposed method combines the advantages of classification trees with the benefit of a more accurate representation of the outliers. For evaluation, we compare our approach with other state-of-the-art anomaly detection algorithms on four standard data sets including the KDD-Cup 99. The results show that the proposed method performs as well as more complex approaches and is even superior on three out of four data sets.

Files:

  Anomaly_Detection_Trees.pdf
  Poster.pdf

BibTex:

@inproceedings{ REIF2008,
	Title = {Anomaly Detection by Combining Decision Trees and Parametric Densities},
	Author = {Matthias Reif and Markus Goldstein and Armin Stahl and Thomas Breuel},
	BookTitle = {Pattern Recognition, 2008. ICPR 2008.},
	Month = {12},
	Year = {2008},
	Publisher = {IEEE}
}

     
Last modified:: 30.08.2016