Outlier detection using k-nearest neighbour graph

@article{Hautamki2004OutlierDU,
  title={Outlier detection using k-nearest neighbour graph},
  author={Ville Hautam{\"a}ki and Ismo K{\"a}rkk{\"a}inen and Pasi Fr{\"a}nti},
  journal={Proceedings of the 17th International Conference on Pattern Recognition, 2004. ICPR 2004.},
  year={2004},
  volume={3},
  pages={430-433 Vol.3}
}
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… CONTINUE READING

6 Figures & Tables

Topics

Statistics

02040'05'06'07'08'09'10'11'12'13'14'15'16'17'18
Citations per Year

175 Citations

Semantic Scholar estimates that this publication has 175 citations based on the available data.

See our FAQ for additional information.