Sciweavers

121 search results - page 1 / 25
» Algorithms for optimal dyadic decision trees
Sort
View
ML
2010
ACM
159views Machine Learning» more  ML 2010»
13 years 3 months ago
Algorithms for optimal dyadic decision trees
Abstract A dynamic programming algorithm for constructing optimal dyadic decision trees was recently introduced, analyzed, and shown to be very effective for low dimensional data ...
Don R. Hush, Reid B. Porter
ML
2007
ACM
13 years 4 months ago
Optimal dyadic decision trees
Gilles Blanchard, Christin Schäfer, Yves Roze...
ICIP
2010
IEEE
13 years 2 months ago
Morphological wavelet transform with adaptive dyadic structures
We propose a two component method for denoising multidimensional signals, e.g. images. The first component uses a dynamic programing algorithm of complexity O(N log N) to find an ...
Zhen James Xiang, Peter J. Ramadge
COLT
2004
Springer
13 years 8 months ago
Oracle Bounds and Exact Algorithm for Dyadic Classification Trees
This paper introduces a new method using dyadic decision trees for estimating a classification or a regression function in a multiclass classification problem. The estimator is bas...
Gilles Blanchard, Christin Schäfer, Yves Roze...
ICML
1998
IEEE
14 years 5 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