Sciweavers

ICPR
2004
IEEE

Outlier Detection Using k-Nearest Neighbour Graph

15 years 11 hour ago
Outlier Detection Using k-Nearest Neighbour Graph
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 resonable results with synthetic data and outperforms compared methods with real data sets with small number of observations.
Ismo Kärkkäinen, Pasi Fränti, Ville
Added 09 Nov 2009
Updated 09 Nov 2009
Type Conference
Year 2004
Where ICPR
Authors Ismo Kärkkäinen, Pasi Fränti, Ville Hautamäki
Comments (0)