A new algorithm based on metaheuristics for data clustering

This paper presents a new algorithm for clustering a large amount of data. We improved the ant colony clustering algorithm that uses an ant’s swarm intelligence, and tried to overcome the weakness of the classical cluster analysis methods. In our proposed algorithm, improvements in the efficiency of an agent operation were achieved, and a new function “cluster condensation” was added. Our proposed algorithm is a processing method by which a cluster size is reduced by uniting similar objects and incorporating them into the cluster condensation. Compared with classical cluster analysis methods, the number of steps required to complete the clustering can be suppressed to 1% or less by performing this procedure, and the dispersion of the result can also be reduced. Moreover, our clustering algorithm has the advantage of being possible even in a small-field cluster condensation. In addition, the number of objects that exist in the field decreases because the cluster condenses; therefore, it becomes possible to add an object to a space that has become empty. In other words, first, the majority of data is put on standby. They are then clustered, gradually adding parts of the standby data to the clustering data. The method can be adopted for a large amount of data. Numerical experiments confirmed that our proposed algorithm can theoretically applied to an unrestricted volume of data.