Ensemble cluster pruning via convex‐concave programming. (5th January 2020)

• Record Type: Journal Article
• Authors: Özöğür‐Akyüz, Süreyya; Otar, Buse Çisil; Atas, Pınar Karadayı
• Is Part Of: Computational intelligence. Volume 36:Number 1(2020)
• Page Start: 297
• Page End: 319
• Publication Date: 2020-01-05
• Subjects: clustering -- DCCP -- ensemble learning -- ensemble pruning -- k‐means; Artificial intelligence -- Periodicals; Computational linguistics -- Periodicals; 006.3
• DOI: 10.1111/coin.12267
• Languages: English
• ISSNs: 0824-7935

Abstract

Summary: Ensemble learning is the process of aggregating the decisions of different learners/models. Fundamentally, the performance of the ensemble relies on the degree of accuracy in individual learner predictions and the degree of diversity among the learners. The trade‐off between accuracy and diversity within the ensemble needs to be optimized to provide the best grouping of learners as it relates to their performance. In this optimization theory article, we propose a novel ensemble selection algorithm which, focusing specifically on clustering problems, selects the optimal subset of the ensemble that has both accurate and diverse models. Those ensemble selection algorithms work for a given number of the best learners within the subset prior to their selection. The cardinality of a subset of the ensemble changes the prediction accuracy. The proposed algorithm in this study determines both the number of best learners and also the best ones. We compared our prediction results to recent ensemble clustering selection algorithms by the number of cardinalities and best predictions, finding better and approximated results to the optimum solutions.