Skip Navigation

The Computer Journal 1997 40(9):547-554; doi:10.1093/comjnl/40.9.547
© 1997 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (17)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Fränti, P.
Right arrow Articles by Nevalainen, O.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Genetic Algorithms for Large-Scale Clustering Problems

P. Fränti1, J. Kivijärvi2, T. Kaukoranta2 and O. Nevalainen2

1 Department of Computer Science, University of Joensuu, PB 111, FIN-80101 Joensuu, Finland Email: franti{at}cs.joensuu.fi, 2 Turku Centre for Computer Science (TUCS), Department of Computer Science, University of Turku, Lemminkäisenkatu 14 A FIN-20520 Turku, Finland

We consider the clustering problem in the case where the distances between elements are metric and both the number of attributes and the number of clusters are large. In this environment the genetic algorithm approach gives high quality clusterings, but at the expense of long running time. Three new and efficient crossover techniques are introduced her. The hybridization of the genetic algorithm and k-means algorithm is discussed.

Received April 28, 1997. revised November 6, 1997.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.