Efficient K-Means Algorithm for Data Clustering Using Calinski Indexing

In Data mining clustering is one of the important tools. Several research areas clustering is to be used and it describe the method for grouping the data. Describes the K-Means clustering algorithm and it has used the best validity index (Calinski index) for the attribute selection, having the value of the validity index as fitness function. Calinski index is to find the best number of clusters for the whole data set. The method is to study the maximum value max_k of i_k (where k is the number of clusters and i_k is the Calinski index value for k clusters). Number of cluster can be calculated by using Calinski index values along with NMF. The rand index value and the accuracy for the Calinski value is obtained, which proves that rand index value and accuracy is better than the existing clusters.