Sciweavers

30 search results - page 1 / 6
» Adjusting for Multiple Comparisons in Decision Tree Pruning
Sort
View
54
Voted
KDD
1997
ACM
86views Data Mining» more  KDD 1997»
15 years 4 months ago
Adjusting for Multiple Comparisons in Decision Tree Pruning
David Jensen, Matthew D. Schmill
KDD
1995
ACM
176views Data Mining» more  KDD 1995»
15 years 4 months ago
MDL-Based Decision Tree Pruning
This paper explores the application of the Minimum Description Length principle for pruning decision trees. We present a new algorithm that intuitively captures the primary goal o...
Manish Mehta 0002, Jorma Rissanen, Rakesh Agrawal
FLAIRS
2008
15 years 2 months ago
A Backward Adjusting Strategy and Optimization of the C4.5 Parameters to Improve C4.5's Performance
In machine learning, decision trees are employed extensively in solving classification problems. In order to design a decision tree classifier two main phases are employed. The fi...
Jason R. Beck, Maria Garcia, Mingyu Zhong, Michael...
ICML
2003
IEEE
16 years 1 months ago
Boosting Lazy Decision Trees
This paper explores the problem of how to construct lazy decision tree ensembles. We present and empirically evaluate a relevancebased boosting-style algorithm that builds a lazy ...
Xiaoli Zhang Fern, Carla E. Brodley
IJCAI
1989
15 years 1 months ago
Generating Better Decision Trees
A new decision tree learning algorithm called IDX is described. More general than existing algorithms, IDX addresses issues of decision tree quality largely overlooked in the arti...
Steven W. Norton