Sciweavers

8 search results - page 1 / 2
» Comparing Simplification Methods for Model Trees with Regres...
Sort
View
ISMIS
2003
Springer
14 years 17 days ago
Comparing Simplification Methods for Model Trees with Regression and Splitting Nodes
In this paper we tackle the problem of simplifying tree-based regression models, called model trees, which are characterized by two types of internal nodes, namely regression nodes...
Michelangelo Ceci, Annalisa Appice, Donato Malerba
ENVSOFT
2006
125views more  ENVSOFT 2006»
13 years 7 months ago
Sensitivity analysis based on regional splits and regression trees (SARS-RT)
A global sensitivity analysis with regional properties is introduced. This method is demonstrated on two synthetic and one hydraulic example. It can be shown that an uncertainty a...
Florian Pappenberger, Ion Iorgulescu, Keith J. Bev...
KDD
2007
ACM
148views Data Mining» more  KDD 2007»
14 years 7 months ago
Scalable look-ahead linear regression trees
Most decision tree algorithms base their splitting decisions on a piecewise constant model. Often these splitting algorithms are extrapolated to trees with non-constant models at ...
David S. Vogel, Ognian Asparouhov, Tobias Scheffer
KDD
2002
ACM
118views Data Mining» more  KDD 2002»
14 years 7 months ago
SECRET: a scalable linear regression tree algorithm
Recently there has been an increasing interest in developing regression models for large datasets that are both accurate and easy to interpret. Regressors that have these properti...
Alin Dobra, Johannes Gehrke
CSDA
2004
77views more  CSDA 2004»
13 years 7 months ago
Variable selection bias in regression trees with constant fits
The greedy search approach to variable selection in regression trees with constant fits is considered. At each node, the method usually compares the maximally selected statistic a...
Yu-Shan Shih, Hsin-Wen Tsai