Performance Analysis of Clustering Algorithms in Detecting Outliers

This paper presents the analysis of Kmeans and K-Medians clustering algorithm in detecting outliers. Clustering is generally used in pattern recognition where if a user wants to search for some particular pattern, clustering reduces the searching load. The k-means clustering and kmedians clustering algorithm’s performance in detecting outliers are analysed here. K-means clustering clusters the similar data with the help of the mean value and squared error criterion. Kmedians is similar to k-means algorithm but median values are calculated there. Outliers are the one different from norm. If they are not properly detected and handled, they clustering will be affected in a great manner.

[1]  B. Achiriloaie,et al.  VI REFERENCES , 1961 .

[2]  Petra Perner,et al.  Data Mining - Concepts and Techniques , 2002, Künstliche Intell..

[3]  Witold Pedrycz,et al.  Data Mining Methods for Knowledge Discovery , 1998, IEEE Trans. Neural Networks.

[4]  Chien-Hsing Chou,et al.  Short Papers , 2001 .

[5]  Sergei Vassilvitskii,et al.  k-means++: the advantages of careful seeding , 2007, SODA '07.

[6]  L M Patnaik,et al.  Feature Extraction using Fuzzy C - Means Clustering for Data Mining Systems , 2006 .

[7]  Urszula Boryczka,et al.  Finding Groups in Data: Cluster Analysis with Ants , 2006, Sixth International Conference on Intelligent Systems Design and Applications.

[8]  Xuemei Cai,et al.  A Novel k-Means Algorithm for Clustering and Outlier Detection , 2009, 2009 Second International Conference on Future Information Technology and Management Engineering.

[9]  Rui Xu,et al.  Survey of clustering algorithms , 2005, IEEE Transactions on Neural Networks.