Cart (Loading....) | Create Account
Close category search window
 

Darwinian, Lamarckian, and Baldwinian (Co)Evolutionary Approaches for Feature Weighting in K -means-Based Algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Gancarski, P. ; Louis Pasteur Univ., Strasbourg ; Blansche, A.

Feature weighting is an aspect of increasing importance in clustering because data are becoming more and more complex. In this paper, we propose new feature weighting methods based on genetic algorithms. These methods use the cost function defined in LKM as a fitness function. We present new methods based on Darwinian, Lamarckian, and Baldwinian evolution. For each one of them, we describe evolutionary and coevolutionary versions. We compare classical hill-climbing optimization with these six genetic algorithms on different datasets. The results show that the proposed methods, except Darwinian methods, are always better than the LKM algorithm.

Published in:

Evolutionary Computation, IEEE Transactions on  (Volume:12 ,  Issue: 5 )

Date of Publication:

Oct. 2008

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.