An Outlier Detection Method Based on Clustering
Authors:
- Rajendra PamulaRPRajendra Pamula
- Jatindra Kumar DekaJDJatindra Kumar Deka
- Sukumar NandiSNSukumar Nandi
- 1 February 2011
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 253-256
Abstract
In this paper we propose a clustering based method to capture outliers. We apply K-means clustering algorithm to divide the data set into clusters. The points which are lying near the centroid of the cluster are not probable candidate for outlier and we can prune out such points from each cluster. Next we calculate a distance based outlier score for remaining points. The computations needed to calculate the outlier score reduces considerably due to the pruning of some points. Based on the outlier score we declare the top n points with the highest score as outliers. The experimental results using real data set demonstrate that even though the number of computations is less, the proposed method performs better than the existing method.Keywords
This publication has 12 references indexed in Scilit:
- A New Local Distance-Based Outlier Detection Approach for Scattered Real-World Data2009
- Fast mining of distance-based outliers in high-dimensional datasetsData Mining and Knowledge Discovery, 2008
- Mining distance-based outliers from large databases in any metric space2006
- Distance-based detection and prediction of outliersIEEE Transactions on Knowledge and Data Engineering, 2005
- Outlier mining in large high-dimensional data setsIEEE Transactions on Knowledge and Data Engineering, 2005
- Fast Outlier Detection in High Dimensional Spaces2002
- LOFACM SIGMOD Record, 2000
- Distance-based outliers: algorithms and applicationsThe VLDB Journal, 2000
- CURE1998
- BIRCHACM SIGMOD Record, 1996