Comparative Study of K-means and Robust Clustering

Data mining is the mechanism of implementing patterns in large amount of data sets involving methods at the intersection of artificial intelligence, machine learning, statistics, and database systems. Clustering is the very big area in which grouping of same type of objects in data mining. Clustering has divided into different categories ? partitioned clustering and hierarchical clustering. In this paper we study two types of clustering first is Kmeans which is part of partitioned clustering. Kmeans clustering generates a specific number of disjoint, flat (non-hierarchical) clusters. Second clustering is robust clustering which is part of hierarchical clustering. This clustering uses Jaccard coefficient instead of using the distance measures to find the similarity between the data or documents to classify the clusters. We show comparison between Kmeans clustering and robust clustering which is better for categorical data.