Automatic clustering with multi-objective differential evolution algorithms

IEEE Congress on Evolutionary Computation(2009)

引用 17|浏览14
暂无评分
摘要
This paper applies the Differential Evolution (DE) algorithm to the task of automatic fuzzy clustering in a Multi-objective Optimization (MO) framework. It compares the performances of four recently developed multi-objective variants of DE over the fuzzy clustering problem, where two conflicting fuzzy validity indices are simultaneously optimized. The resultant Pareto optimal set of solutions from each algorithm consists of a number of nondominated solutions, from which the user can choose the most promising ones according to the problem specifications. A real-coded representation of the search variables, accommodating variable number of cluster centers, is used for DE. The performances of four DE variants have also been contrasted to that of two most well-known schemes of MO clustering namely the Non Dominated Sorting Genetic Algorithm ( NSGA II) and Multi-Objective Clustering with an unknown number of Clusters K (MOCK). Experimental results over six artificial and four real life datasets of varying range of complexities indicates that DE holds immense promise as a candidate algorithm for devising MO clustering schemes.
更多
查看译文
关键词
unknown number,variable number,candidate algorithm,automatic fuzzy clustering,mo clustering,multi-objective differential evolution algorithm,problem specification,fuzzy clustering problem,devising mo clustering scheme,conflicting fuzzy validity index,automatic clustering,de variant,data handling,genetic algorithms,fuzzy clustering,sorting,classification algorithms,multi objective optimization,optimization,clustering algorithms,data mining,indexes,fuzzy set theory,machine intelligence,quality of service,differential evolution,pareto optimization
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要