A review: accuracy optimization in clustering ensembles using genetic algorithms

被引:23
作者
Ghaemi, Reza [1 ,2 ]
bin Sulaiman, Nasir [2 ]
Ibrahim, Hamidah [2 ]
Mustapha, Norwati [2 ]
机构
[1] Islamic Azad Univ, Quchan Branch, CE Dept, Tehran, Iran
[2] Univ Putra Malaysia UPM, Dept Comp Sci, Fac Comp Sci & Informat Technol, Selangor, Malaysia
关键词
Accuracy; Clustering ensemble; Genetic algorithms; Unsupervised classification;
D O I
10.1007/s10462-010-9195-5
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The clustering ensemble has emerged as a prominent method for improving robustness, stability, and accuracy of unsupervised classification solutions. It combines multiple partitions generated by different clustering algorithms into a single clustering solution. Genetic algorithms are known as methods with high ability to solve optimization problems including clustering. To date, significant progress has been contributed to find consensus clustering that will yield better results than existing clustering. This paper presents a survey of genetic algorithms designed for clustering ensembles. It begins with the introduction of clustering ensembles and clustering ensemble algorithms. Subsequently, this paper describes a number of suggested genetic-guided clustering ensemble algorithms, in particular the genotypes, fitness functions, and genetic operations. Next, clustering accuracies among the genetic-guided clustering ensemble algorithms is compared. This paper concludes that using genetic algorithms in clustering ensemble improves the clustering accuracy and addresses open questions subject to future research.
引用
收藏
页码:287 / 318
页数:32
相关论文
共 59 条
[1]  
analoui M, 2006, INT FED INFO PROC, V228, P227
[2]  
[Anonymous], 2002, Evolutionary algorithms for solving multi-objective problems
[3]  
[Anonymous], 4 INT C NAT COMP IEE
[4]  
[Anonymous], P GEN EV COMP C
[5]  
[Anonymous], INT WORKSH COMP ARCH
[6]  
[Anonymous], IEEE T NEURAL NETW
[7]  
[Anonymous], FINDING CONSISTENT C
[8]  
[Anonymous], P INT C MACH LEARN M
[9]  
[Anonymous], P 20 INT C MACH LEAR
[10]  
[Anonymous], P 5 INT C HYBR INT S