Multi-Objective Genetic Algorithm for Robust Clustering with Unknown Number of Clusters

Multi-Objective Genetic Algorithm for Robust Clustering with Unknown Number of Clusters

Amit Banerjee
Copyright: © 2012 |Volume: 3 |Issue: 1 |Pages: 20
ISSN: 1942-3594|EISSN: 1942-3608|EISBN13: 9781466610712|DOI: 10.4018/jaec.2012010101
Cite Article Cite Article

MLA

Banerjee, Amit. "Multi-Objective Genetic Algorithm for Robust Clustering with Unknown Number of Clusters." IJAEC vol.3, no.1 2012: pp.1-20. http://doi.org/10.4018/jaec.2012010101

APA

Banerjee, A. (2012). Multi-Objective Genetic Algorithm for Robust Clustering with Unknown Number of Clusters. International Journal of Applied Evolutionary Computation (IJAEC), 3(1), 1-20. http://doi.org/10.4018/jaec.2012010101

Chicago

Banerjee, Amit. "Multi-Objective Genetic Algorithm for Robust Clustering with Unknown Number of Clusters," International Journal of Applied Evolutionary Computation (IJAEC) 3, no.1: 1-20. http://doi.org/10.4018/jaec.2012010101

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

In this paper, a multi-objective genetic algorithm for data clustering based on the robust fuzzy least trimmed squares estimator is presented. The proposed clustering methodology addresses two critical issues in unsupervised data clustering – the ability to produce meaningful partition in noisy data, and the requirement that the number of clusters be known a priori. The multi-objective genetic algorithm-driven clustering technique optimizes the number of clusters as well as cluster assignment, and cluster prototypes. A two-parameter, mapped, fixed point coding scheme is used to represent assignment of data into the true retained set and the noisy trimmed set, and the optimal number of clusters in the retained set. A three-objective criterion is also used as the minimization functional for the multi-objective genetic algorithm. Results on well-known data sets from literature suggest that the proposed methodology is superior to conventional fuzzy clustering algorithms that assume a known value for optimal number of clusters.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.