DOE OSTI · 956380
Algorithms for optimal dyadic decision trees
Abstract
A new algorithm for constructing optimal dyadic decision trees was recently introduced, analyzed, and shown to be very effective for low dimensional data sets. This paper enhances and extends this algorithm by: introducing an adaptive grid search for the regularization parameter that guarantees optimal solutions for all relevant trees sizes, revising the core tree-building algorithm so that its run time is substantially smaller for most regularization parameter values on the grid, and incorporating new data structures and data pre-processing steps that provide significant run time enhancement in practice.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Hush, Don, Porter, Reid. 2009-01-01. Algorithms for optimal dyadic decision trees. https://www.osti.gov/biblio/956380
Cite the original work for its findings. Save a collection to share your selection of sources.