Clustering-Based Ensembles as an Alternative to Stacking

被引:22
作者
Jurek, Anna [1 ]
Bi, Yaxin [1 ]
Wu, Shengli [1 ]
Nugent, Chris D. [1 ]
机构
[1] Univ Ulster, Sch Comp & Math, Newtownabbey BT37 0QB, Antrim, North Ireland
关键词
Combining classifiers; stacking; ensembles; clustering; meta-learning; semi-supervised classification; DYNAMIC CLASSIFIER SELECTION; COMBINING CLASSIFIERS; COMBINATION;
D O I
10.1109/TKDE.2013.49
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
One of the most popular techniques of generating classifier ensembles is known as stacking which is based on a meta-learning approach. In this paper, we introduce an alternative method to stacking which is based on cluster analysis. Similar to stacking, instances from a validation set are initially classified by all base classifiers. The output of each classifier is subsequently considered as a new attribute of the instance. Following this, a validation set is divided into clusters according to the new attributes and a small subset of the original attributes of the instances. For each cluster, we find its centroid and calculate its class label. The collection of centroids is considered as a meta-classifier. Experimental results show that the new method outperformed all benchmark methods, namely Majority Voting, Stacking J48, Stacking LR, AdaBoost J48, and Random Forest, in 12 out of 22 data sets. The proposed method has two advantageous properties: it is very robust to relatively small training sets and it can be applied in semi-supervised learning problems. We provide a theoretical investigation regarding the proposed method. This demonstrates that for the method to be successful, the base classifiers applied in the ensemble should have greater than 50% accuracy levels.
引用
收藏
页码:2120 / 2137
页数:18
相关论文
共 50 条
[1]   Clustering-based ensembles for one-class classification [J].
Krawczyk, Bartosz ;
Wozniak, Michal ;
Cyganek, Boguslaw .
INFORMATION SCIENCES, 2014, 264 :182-195
[2]   Novel clustering-based pruning algorithms [J].
Zyblewski, Pawel ;
Wozniak, Michal .
PATTERN ANALYSIS AND APPLICATIONS, 2020, 23 (03) :1049-1058
[3]   A Clustering-based Recommendation System [J].
Wu, Shaofei .
PROCEEDINGS OF 2008 INTERNATIONAL PRE-OLYMPIC CONGRESS ON COMPUTER SCIENCE, VOL I: COMPUTER SCIENCE AND ENGINEERING, 2008, :328-330
[4]   Clustering-Based Spatial Interpolation of Parametric Postprocessing Models [J].
Baran, Sandor ;
Lakatos, Maria .
WEATHER AND FORECASTING, 2024, 39 (11) :1591-1604
[5]   Clustering-Based Incremental Web Crawling [J].
Tan, Qingzhao ;
Mitra, Prasenjit .
ACM TRANSACTIONS ON INFORMATION SYSTEMS, 2010, 28 (04)
[6]   Random clustering-based outlier detector [J].
Kiersztyn A. ;
Pylak D. ;
Horodelski M. ;
Kiersztyn K. ;
Urbanovich P. .
Information Sciences, 2024, 667
[7]   Clustering-based preconditioning for stochastic programs [J].
Cao, Yankai ;
Laird, Carl D. ;
Zavala, Victor M. .
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2016, 64 (02) :379-406
[8]   A clustering-based discretization for supervised learning [J].
Gupta, Ankit ;
Mehrotra, Kishan G. ;
Mohan, Chilukuri .
STATISTICS & PROBABILITY LETTERS, 2010, 80 (9-10) :816-824
[9]   Novel clustering-based pruning algorithms [J].
Paweł Zyblewski ;
Michał Woźniak .
Pattern Analysis and Applications, 2020, 23 :1049-1058
[10]   Clustering-based preconditioning for stochastic programs [J].
Yankai Cao ;
Carl D. Laird ;
Victor M. Zavala .
Computational Optimization and Applications, 2016, 64 :379-406