Purpose – A new algorithm based on ant colony optimization (ACO) for data clustering has been developed.Design/methodology/approach – ACO technique along with simulated annealing, tournament selection (GA), Tabu search and density distribution are used to solve unsupervised clustering problem for making similar groups from arbitrarily entered large data.Findings – Distinctive clusters of similar data are formed metaheuritically from arbitrarily entered mixed data based on similar attributes of data.Research limitations/implications – The authors have run a computer program for a number of cases related to data clustering. So far, there are no problems in convergence of results for formation of distinctive similar groups with given data set quickly and accurately.Practical implications – ACO‐based method developed here can be applied to practical industrial problems for mobile robotic navigation other than data clustering and travelling salesman.Originality/value – This paper will enable the solving of pro...
[1]
Alex Alves Freitas,et al.
Data mining with an ant colony optimization algorithm
,
2002,
IEEE Trans. Evol. Comput..
[2]
Nicolas Monmarché,et al.
On how Pachycondyla apicalis ants suggest a new search algorithm
,
2000,
Future Gener. Comput. Syst..
[3]
Nicolas Monmarché,et al.
A new clustering algorithm based on the chemical recognition system of ants
,
2002
.
[4]
Cheng-Fa Tsai,et al.
ACODF: a novel data clustering approach for data mining in large databases
,
2004
.
[5]
M Dorigo,et al.
Ant colonies for the travelling salesman problem.
,
1997,
Bio Systems.
[6]
Marco Dorigo,et al.
Ant colony optimization
,
2006,
IEEE Computational Intelligence Magazine.
[7]
A. K. Pujari,et al.
Data Mining Techniques
,
2006
.
[8]
Ashish Ghosh,et al.
Aggregation pheromone density based data clustering
,
2008,
Inf. Sci..