Title :
A Cluster-Oriented Genetic Algorithm for Alternative Clustering
Author :
Duy Tin Truong ; Battiti, Roberto
Author_Institution :
Univ. of Trento, Trento, Italy
Abstract :
Supervised alternative clusterings is the problem of finding a set of clusterings which are of high quality and different from a given negative clustering. The task is therefore a clear multi-objective optimization problem. Optimizing two conflicting objectives requires dealing with trade-offs. Most approaches in the literature optimize these objectives sequentially or indirectly, resulting in solutions which are dominated. We develop a multi-objective algorithm, called COGNAC, able to optimize the objectives directly and simultaneously and producing solutions approximating the Pareto front. COGNAC performs the recombination operator at the cluster level instead of the object level as in traditional genetic algorithms. It can accept arbitrary clustering quality and dissimilarity objectives and provide solutions dominating those of other state-of-the-art algorithms. COGNAC can also be used to generate a sequence of alternative clusterings, each of which is guaranteed to be different from all previous ones.
Keywords :
Pareto optimisation; approximation theory; genetic algorithms; learning (artificial intelligence); pattern clustering; COGNAC algorithm; Pareto front approximation; arbitrary clustering quality; cluster-oriented genetic algorithm; conflicting objective; dissimilarity objective; multiobjective optimization problem; negative clustering; recombination operator; supervised alternative clustering; Birds; Clustering algorithms; Complexity theory; Face; Genetic algorithms; Sociology; Statistics; alternative clustering; cluster-oriented; genetic algorithm; multi-objective optimization;
Conference_Titel :
Data Mining (ICDM), 2012 IEEE 12th International Conference on
Conference_Location :
Brussels
Print_ISBN :
978-1-4673-4649-8
DOI :
10.1109/ICDM.2012.55