.png){kind=icon}
.png){kind=icon}
Return
Rotation Forests for regression
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2013.03.139.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Rotation Forest, originally proposed for the combination of classifiers, has shown itself to be very competitive, when compared with other ensemble construction methods. In this paper, the performance of Rotation Forest for combining regressors is investigated using a broad range of datasets, 61 in total, which vary in size from 13 to more than 40,000 instances, and from 2 to 60 attributes, with both numeric and nominal attributes. Rotation Forest has favourable results when compared with Bagging, Random Subspaces, Iterated Bagging and AdaBoost. R2, according to average ranks and a scoring matrix. Diversity error diagrams are used to analyse the behaviour of the ensemble methods. (C) 2013 Elsevier Inc. All rights reserved.
Keywords:
Rotation Forest
Bagging
Random Subspaces
Boosting
Ensembles
Regression
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W
