loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
17th International Conference on Pattern Recognition (ICPR'04) - Volume 3
Outlier Detection Using k-Nearest Neighbour Graph
Cambridge UK
August 23-August 26
ISBN: 0-7695-2128-2
Ville Hautam?ki, University of Joensuu, Finland
Ismo K?rkk?inen, University of Joensuu, Finland
Pasi Fr?nti, University of Joensuu, Finland
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.
Citation:
Ville Hautam?ki, Ismo K?rkk?inen, Pasi Fr?nti, "Outlier Detection Using k-Nearest Neighbour Graph," icpr, vol. 3, pp.430-433, 17th International Conference on Pattern Recognition (ICPR'04) - Volume 3, 2004
Usage of this product signifies your acceptance of the Terms of Use.