In previous work, we have proposed a novel approach to data clustering based on the explicit optimization of a partitioning with respect to two complementary clustering objectives . Here, we extend this idea by describing an advanced multiobjective clustering algorithm, MOCK, with the capacity to identify good solutions from the Pareto front, and to automatically determine the number of clusters in a data set. The algorithm has been subject to a thorough comparison with alternative clustering techniques and we briefly summarize these results. We then present investigations into the mechanisms at the heart of MOCK: we discuss a simple example demonstrating the synergistic effects at work in multiobjective clustering, which explain its superiority to single-objective clustering techniques, and we analyse how MOCK's Pareto fronts compare to the performance curves obtained by single-objective algorithms run with a range of different numbers of clusters specified, © Springer-Verlag Berlin Heidelberg 2005.
|Name||Lecture Notes in Computer Science|
|Conference||Third International Conference on Evolutionary Multi-Criterion Optimization, EMO 2005|
|Period||1/07/05 → …|
- Automatic determination of the number of clusters
- Evolutionary algorithms
- Multiobjective optimization