Automatic clustering based on invasive weed optimization algorithm

26Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this article, an evolutionary metaheuristic algorithm known as the Invasive Weed Optimization (IWO) is applied for automatically partitioning a dataset without any prior information about the number of naturally occurring groups in the data. The fitness function used in the genetic algorithm is a cluster validity index. Depending on the results of this index IWO returns the segmented dataset along with the appropriate number of divisions. The proficiency of this algorithm is compared to variable string length genetic algorithm with point symmetry based distance clustering(VGAPS-clustering), variable string length Genetic K-means algorithm(GCUK-clustering) and a weighted sum validity function based hybrid niching genetic algorithm(HNGA-clustering) and is denoted for the nine artificial datasets and four real life datasets. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Chowdhury, A., Bose, S., & Das, S. (2011). Automatic clustering based on invasive weed optimization algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7077 LNCS, pp. 105–112). https://doi.org/10.1007/978-3-642-27242-4_13

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free