Sciweavers

63 search results - page 6 / 13
» MDL-Based Decision Tree Pruning
Sort
View
96
Voted
ILP
2005
Springer
15 years 5 months ago
Predicate Selection for Structural Decision Trees
Abstract. We study predicate selection functions (also known as splitting rules) for structural decision trees and propose two improvements to existing schemes. The first is in cl...
Kee Siong Ng, John W. Lloyd
ICML
2007
IEEE
16 years 14 days ago
Sample compression bounds for decision trees
We propose a formulation of the Decision Tree learning algorithm in the Compression settings and derive tight generalization error bounds. In particular, we propose Sample Compres...
Mohak Shah
100
Voted
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...
82
Voted
ECAI
2004
Springer
15 years 5 months ago
Explaining the Result of a Decision Tree to the End-User
This paper addresses the problem of the explanation of the result given by a decision tree, when it is used to predict the class of new cases. In order to evaluate this result, the...
Isabelle Alvarez
ICML
2001
IEEE
16 years 14 days ago
Obtaining calibrated probability estimates from decision trees and naive Bayesian classifiers
Accurate, well-calibrated estimates of class membership probabilities are needed in many supervised learning applications, in particular when a cost-sensitive decision must be mad...
Bianca Zadrozny, Charles Elkan