Sarkar, Manish ; Yegnanarayana, B. ; Khemani, Deepak (1997) A clustering algorithm using an evolutionary programming-based approach Pattern Recognition Letters, 18 (10). pp. 975-986. ISSN 0167-8655
Full text not available from this repository.
Official URL: http://www.sciencedirect.com/science/article/pii/S...
Related URL: http://dx.doi.org/10.1016/S0167-8655(97)00122-0
Abstract
In this paper, an evolutionary programming-based clustering algorithm is proposed. The algorithm effectively groups a given set of data into an optimum number of clusters. The proposed method is applicable for clustering tasks where clusters are crisp and spherical. This algorithm determines the number of clusters and the cluster centers in such a way that locally optimal solutions are avoided. The result of the algorithm does not depend critically on the choice of the initial cluster centers.
| Item Type: | Article |
|---|---|
| Source: | Copyright of this article belongs to Elsevier Science. |
| Keywords: | Clustering; K-means; Optimization; Evolutionary Programming |
| ID Code: | 57748 |
| Deposited On: | 29 Aug 2011 11:51 |
| Last Modified: | 29 Aug 2011 11:51 |
Repository Staff Only: item control page
