A comparative study of clustering ensemble algorithms. (May 2018)

• Record Type: Journal Article
• Authors: Wu, Xiuge; Ma, Tinghuai; Cao, Jie; Tian, Yuan; Alabdulkarim, Alia
• Is Part Of: Computers & electrical engineering. Volume 68(2018)
• Page Start: 603
• Page End: 615
• Publication Date: 2018-05
• Subjects: Clustering ensemble -- Generative mechanism -- Consensus function -- Ensemble member -- Diversity -- Ensemble size; Computer engineering -- Periodicals; Electrical engineering -- Periodicals; Electrical engineering -- Data processing -- Periodicals; Ordinateurs -- Conception et construction -- Périodiques; Électrotechnique -- Périodiques; Électrotechnique -- Informatique -- Périodiques; Computer engineering; Electrical engineering; Electrical engineering -- Data processing; Periodicals; Electronic journals; 621.302854
• DOI: 10.1016/j.compeleceng.2018.05.005
• Languages: English
• ISSNs: 0045-7906

Abstract

Abstract: Since clustering ensemble was proposed, it has rapidly attracted much attention. This paper makes an overview of recent research on clustering ensemble about generative mechanism, selective clustering ensemble, consensus function and application. Twelve clustering ensemble algorithms are described and compared to choose a basic one. The experiment shows that using k-means with different initializations as generative mechanism and average-linkage agglomerative clustering as consensus function is the best one. As ensemble size increases, the performance of clustering ensemble improves. The basic clustering ensemble algorithm with suitable ensemble size is compared with clustering algorithms and the experiment shows that clustering ensemble is better than clustering. The influence of diversity on clustering ensemble is instructive to selecting members. The experiment shows that selecting members in high quality and big diversity for low-dimensional data sets, and selecting members in high quality and median diversity for high-dimensional data sets are better than traditional clustering ensemble.