Outlier detection using k-nearest neighbour graph

Ville Hautamäki, Ismo Kärkkäinen, Pasi Fränti · Proceedings of the 17th International Conference on Pattern Recognition, 2004. ICPR 2004. · 2004

We present an outlier detection using indegree number (ODIN) algorithm that utilizes k-nearest neighbour graph. Improvements to existing kNN distance-based method are also proposed. We compare the methods with real and synthetic datasets. The results show that the proposed method achieves reasonable results with synthetic data and outperforms compared methods with real data sets with small number of observations.

Read the paper · More papers on PaperTik