DocumentCode
3734304
Title
Combining ensembles algorithms of symbolic learners
Author
Anastasia-Dimitra Lipitakis;Sotiris Kotsiantis
Author_Institution
Department of Mathematics, University of Patras, Greece
fYear
2015
fDate
7/1/2015 12:00:00 AM
Firstpage
1
Lastpage
6
Abstract
In this research work an ensemble of bagging, boosting, rotation forest, decorate and random subspace methods with 5 symbolic sub-classifiers in each one is presented. Then a voting methodology is used for the final prediction. In order to decrease training time, before building the ensemble redundant features were removed using a slight filter feature selection method. A comparison with simple bagging, boosting, rotation forest, decorate and random subspace methods ensembles with 25 symbolic sub-classifiers is performed, as well as other well-known combining methods, on standard benchmark datasets. The proposed technique is shown to be more accurate than other related methods in most cases.
Keywords
"Bagging","Boosting","Classification algorithms","Training","Prediction algorithms","Decision trees","Machine learning algorithms"
Publisher
ieee
Conference_Titel
Information, Intelligence, Systems and Applications (IISA), 2015 6th International Conference on
Type
conf
DOI
10.1109/IISA.2015.7388118
Filename
7388118
Link To Document