Sciweavers

63 search results - page 2 / 13
» MDL-Based Decision Tree Pruning
Sort
View
ICML
1998
IEEE
14 years 8 months ago
A Fast, Bottom-Up Decision Tree Pruning Algorithm with Near-Optimal Generalization
In this work, we present a new bottom-up algorithmfor decision tree pruning that is very e cient requiring only a single pass through the given tree, and prove a strong performanc...
Michael J. Kearns, Yishay Mansour
VLDB
1998
ACM
120views Database» more  VLDB 1998»
13 years 11 months ago
PUBLIC: A Decision Tree Classifier that Integrates Building and Pruning
Classification is an important problem in data mining. Given a database of records, each with a class label, a classifier generates a concise and meaningful description for each c...
Rajeev Rastogi, Kyuseok Shim
CSDA
2006
91views more  CSDA 2006»
13 years 7 months ago
Maximum a posteriori pruning on decision trees and its application to bootstrap BUMPing
The cost-complexity pruning generates nested subtrees and selects the best one. However, its computational cost is large since it uses holdout sample or cross-validation. On the o...
Jinseog Kim, Yongdai Kim
ICTAI
2002
IEEE
14 years 9 days ago
Error-Based Pruning of Decision Trees Grown on Very Large Data Sets Can Work!
Lawrence O. Hall, Richard Collins, Kevin W. Bowyer...
ICPR
2008
IEEE
14 years 1 months ago
Properties of the k-norm pruning algorithm for decision tree classifiers
Mingyu Zhong, Michael Georgiopoulos, Georgios C. A...