A Clustering Algorithm Using The Tabu SearchApproach With Simulated Annealing
Shu‐Chuan Chu, John F. Roddick · WIT transactions on information and communication technologies · 2000
Not cached yet. This record was fetched live for this request and is stored after the lookup. Reopening the page should serve the cached copy.
WIT transactions on information and communication technologies · WIT Press · article · 2000
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 solution 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 clustering algorithms can be simply classied into the following two categories: hierarchical clustering and partitional clustering [1]. The hierarchical clustering operates by partitioning the patterns into successively fewer structures. This method gives rise to a d...
Open the resolved locator · 10.2495/data000501
Metadata licence: OpenAlex metadata (CC0)