Improving the scalability of EA techniques: a case study in clustering

  • Authors:
  • Stefan R. Bach;A. Şima Uyar;Jürgen Branke

  • Affiliations:
  • University of Karlsruhe, Faculty of Informatics, Karlsruhe, Germany;Istanbul Technical University, Department of Computer Engineering, Maslak, Istanbul, Turkey;University of Warwick, Warwick Business School, Coventry, UK

  • Venue:
  • EA'09 Proceedings of the 9th international conference on Artificial evolution
  • Year:
  • 2009

Quantified Score

Hi-index 0.01

Visualization

Abstract

This paper studies how evolutionary algorithms (EA) scale with growing genome size, when used for similarity-based clustering. A simple EA and EAs with problem-dependent knowledge are experimentally evaluated for clustering up to 100,000 objects. We find that EAs with problem-dependent crossover or hybridization scale near-linear in the size of the similarity matrix, while the simple EA, even with problem-dependent initialization, fails at moderately large genome sizes.