A Clustering Algorithm Using The Tabu Search Approach With Simulated Annealing
Price
Free (open access)
Volume
25
Pages
9
Published
2000
Size
798 kb
Paper DOI
10.2495/DATA000501
Copyright
WIT Press
Author(s)
S.C. Chu & J.F. Roddick
Abstract
In this paper, an algorithm for cluster generation using tabu search approach with simulated annealing is proposed. The main idea of this algorithm is to use the tabu search approach to generate non-local moves for the clusters and apply the simulated annealing technique to select suitable current best solu- tion so that speed the cluster generation. Experimental results demonstrate the proposed tabu search approach with simulated annealing algorithm for cluster generation is superior to the tabu search approach with Generalised Lloyd algorithm. 1 Clustering Clustering is the process of grouping patterns into a number of clusters, each of which contains the patterns that are similar to each other in some way. The existing
Keywords