%0 Journal Article %1 Handl04evolutionaryMultiobjectiveClustering %A Handl, Julia %A Knowles, Joshua %D 2004 %J Parallel Problem Solving from Nature - PPSN VIII %K 04 Handl clustering evolutionary multiobjective %P 1081--1091 %T Evolutionary Multiobjective Clustering %U http://www.springerlink.com/content/ldwx2vdl3gb4egh1 %X A new approach to data clustering is proposed, in which two or more measures of cluster quality are simultaneously optimized using a multiobjective evolutionary algorithm (EA). For this purpose, the PESA-II EA is adapted for the clustering problem by the incorporation of specialized mutation and initialization procedures, described herein. Two conceptually orthogonal measures of cluster quality are selected for optimization, enabling, for the first time, a clustering algorithm to explore and improve different compromise solutions during the clustering process. Our results, on a diverse suite of 15 real and synthetic data sets – where the correct classes are known – demonstrate a clear advantage to the multiobjective approach: solutions in the discovered Pareto set are objectively better than those obtained when the same EA is applied to optimize just one measure. Moreover, the multiobjective EA exhibits a far more robust level of performance than both the classic k-means and average-link agglomerative clustering algorithms, outperforming them substantially on aggregate. ER -

@article{Handl04evolutionaryMultiobjectiveClustering, abstract = {A new approach to data clustering is proposed, in which two or more measures of cluster quality are simultaneously optimized using a multiobjective evolutionary algorithm (EA). For this purpose, the PESA-II EA is adapted for the clustering problem by the incorporation of specialized mutation and initialization procedures, described herein. Two conceptually orthogonal measures of cluster quality are selected for optimization, enabling, for the first time, a clustering algorithm to explore and improve different compromise solutions during the clustering process. Our results, on a diverse suite of 15 real and synthetic data sets – where the correct classes are known – demonstrate a clear advantage to the multiobjective approach: solutions in the discovered Pareto set are objectively better than those obtained when the same EA is applied to optimize just one measure. Moreover, the multiobjective EA exhibits a far more robust level of performance than both the classic k-means and average-link agglomerative clustering algorithms, outperforming them substantially on aggregate. ER -}, added-at = {2008-12-06T00:08:01.000+0100}, author = {Handl, Julia and Knowles, Joshua}, biburl = {https://www.bibsonomy.org/bibtex/2220e41c2ea667eb149c98499ea122eed/lee_peck}, description = {SpringerLink - Book Chapter}, interhash = {ec12bc2846a11ccbbf98dab76abfa65f}, intrahash = {220e41c2ea667eb149c98499ea122eed}, journal = {Parallel Problem Solving from Nature - PPSN VIII}, keywords = {04 Handl clustering evolutionary multiobjective}, pages = {1081--1091}, timestamp = {2008-12-06T00:08:01.000+0100}, title = {Evolutionary Multiobjective Clustering}, url = {http://www.springerlink.com/content/ldwx2vdl3gb4egh1}, year = 2004 }