6533b81ffe1ef96bd1277a08
RESEARCH PRODUCT
Alternating model trees
Eibe FrankStefan KramerMichael Mayosubject
Boosting (machine learning)Computer scienceWeight-balanced treeDecision treeLogistic model treeStatistics::Machine LearningComputingMethodologies_PATTERNRECOGNITIONTree structureStatisticsLinear regressionAlternating decision treeGradient boostingSimple linear regressionAlgorithmdescription
Model tree induction is a popular method for tackling regression problems requiring interpretable models. Model trees are decision trees with multiple linear regression models at the leaf nodes. In this paper, we propose a method for growing alternating model trees, a form of option tree for regression problems. The motivation is that alternating decision trees achieve high accuracy in classification problems because they represent an ensemble classifier as a single tree structure. As in alternating decision trees for classification, our alternating model trees for regression contain splitter and prediction nodes, but we use simple linear regression functions as opposed to constant predictors at the prediction nodes. Moreover, additive regression using forward stagewise modeling is applied to grow the tree rather than a boosting algorithm. The size of the tree is determined using cross-validation. Our empirical results show that alternating model trees achieve significantly lower squared error than standard model trees on several regression datasets.
year | journal | country | edition | language |
---|---|---|---|---|
2015-04-13 | Proceedings of the 30th Annual ACM Symposium on Applied Computing |