Title :
Classifier Ensembles with the Extended Space Forest
Author :
Amasyali, M.F. ; Ersoy, Okan K.
Author_Institution :
Dept. of Comput. Eng., Yildiz Tech. Univ., Istanbul, Turkey
Abstract :
The extended space forest is a new method for decision tree construction in which training is done with input vectors including all the original features and their random combinations. The combinations are generated with a difference operator applied to random pairs of original features. The experimental results show that extended space versions of ensemble algorithms have better performance than the original ensemble algorithms. To investigate the success dynamics of the extended space forest, the individual accuracy and diversity creation powers of ensemble algorithms are compared. The Extended Space Forest creates more diversity when it uses all the input features than Bagging and Rotation Forest. It also results in more individual accuracy when it uses random selection of the features than Random Subspace and Random Forest methods. It needs more training time because of using more features than the original algorithms. But its testing time is lower than the others because it generates less complex base learners.
Keywords :
decision trees; learning (artificial intelligence); pattern classification; classifier ensembles; combination generation; decision tree construction; difference operator; ensemble algorithms; extended space forest; supervised learning; Accuracy; Bagging; Classification algorithms; Decision trees; Heuristic algorithms; Testing; Training; Classifier ensembles; bagging; committees of learners; consensus theory; decision trees; ensemble algorithms; extended spaces; mixtures of experts; multiple classifier systems; random forest; random subspace; rotation forest; supervised learning;
Journal_Title :
Knowledge and Data Engineering, IEEE Transactions on
DOI :
10.1109/TKDE.2013.9