arrow
Return

Feature Selection Inspired Classifier Ensemble Reduction

delete2014-08-01
delete80
delete
OA
AI
R
Ren Diao *
F
Fei Chao
T
Taoxin Peng
N
Neal Snooke
Q
Qiang Shen
DOI:10.1109/TCYB.2013.2281820delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Classifier ensembles constitute one of the main research directions in machine learning and data mining. The use of multiple classifiers generally allows better predictive performance than that achievable with a single model. Several approaches exist in the literature that provide means to construct and aggregate such ensembles. However, these ensemble systems contain redundant members that, if removed, may further increase group diversity and produce better results. Smaller ensembles also relax the memory and storage requirements, reducing system's run-time overhead while improving overall efficiency. This paper extends the ideas developed for feature selection problems to support classifier ensemble reduction, by transforming ensemble predictions into training samples, and treating classifiers as features. Also, the global heuristic harmony search is used to select a reduced subset of such artificial features, while attempting to maximize the feature subset evaluation. The resulting technique is systematically evaluated using high dimensional and large sized benchmark datasets, showing a superior classification performance against both original, unreduced ensembles, and randomly formed subsets.
Keywords:
Classifier ensemble reduction
feature selection
harmony search

Journal

IEEE Transactions on Cybernetics cover
IEEE Transactions on Cybernetics
IF:
10.5
Papers:
1.1W
Citations:
5.0W

Organization

E
Edinburgh Napier University
Scholars:
2.2K
Papers: 2.4K
Citations: 2.9K
A
Aberystwyth University
Scholars:
2.5K
Papers: 2.5K
Citations: 4.3K
X
xiamen university
Scholars:
5.8W
Papers: 3.8W
Citations: 67
researcher View more organizations