Improved Ant Colony Optimization in K-Means for Data Clustering

Abstract

Clustering is grouping of similar data points in clusters. Clustering has many applications, particularly in big data analytics. In data mining, traditional algorithm are used for clustering. These algorithms are inefficient in terms quality of cluster. This paper attempts to improvise the traditional K-mean by adding the Ant Colony Optimization algorithm (ACO) for improving the centroid for better clustering. This combination of ACO in K-mean and IACO in K-mean is experimented on iris and skin segmentation supervised datasets. Experimental results show that the performance in terms of F-measure for IACO in K-mean is better than ACO in K-mean and traditional K-means for iris and skin segmentation datasets.