Feature weighting is a more and more important step in clustering because data become more and more complex. An embedded local feature weighting method has been proposed in [1]. In this paper, we present a new method based on the same cost function, but performed through a genetic algorithm. The learning process can be performed through an evolutionary approach or through a cooperavive coevolutionary approach. Moreover, the genetic algorithm can be combined with the original Weighting K-means algorithm in a Lamarckian learning paradigm. We compare hill-climbing optimization versus genetic algorithms, evolutionary versus coevolutionary approaches, and Darwinian versus Lamarckian learning on different datasets. The results seem to show that, on the datasets where the original algorithm is efficient, the proposed methods are even better. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Blansché, A., Gançarski, P., & Korczak, J. J. (2005). Genetic algorithms for feature weighting: Evolution vs. coevolution and darwin vs. lamarck. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3789 LNAI, pp. 682–691). Springer Verlag. https://doi.org/10.1007/11579427_69
Mendeley helps you to discover research relevant for your work.