Mitra, Sushmita (2004) An evolutionary rough partitive clustering Pattern Recognition Letters, 25 (12). pp. 1439-1449. ISSN 0167-8655
Full text not available from this repository.
Official URL: https://doi.org/10.1016/j.patrec.2004.05.007
Related URL: http://dx.doi.org/10.1016/j.patrec.2004.05.007
Abstract
An evolutionary rough c-means clustering algorithm is proposed. Genetic algorithms are employed to tune the threshold, and relative importance of upper and lower approximations of the rough sets modeling the clusters. The Davies–Bouldin clustering validity index is used as the fitness function, that is minimized while arriving at an optimal partitioning. A comparative study of its performance is made with related partitive algorithms. The effectiveness of the algorithm is demonstrated on real and synthetic datasets, including microarray gene expression data from Bioinformatics.
| Item Type: | Article |
|---|---|
| Source: | Copyright of this article belongs to Elsevier B.V. |
| ID Code: | 140127 |
| Deposited On: | 07 Sep 2025 07:04 |
| Last Modified: | 07 Sep 2025 07:04 |
Repository Staff Only: item control page
