✦ LIBER ✦

Approximating Optimal Binary Decision Trees

✍ Scribed by Micah Adler; Brent Heeringa

Publisher: Springer
Year: 2011
Tongue: English
Weight: 389 KB
Volume: 62
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-011-9510-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimal dyadic decision trees

✍ G. Blanchard; C. Schäfer; Y. Rozenholc; K.-R. Müller 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 885 KB

Optimal binary split trees

✍ Shou-Hsuan Stephen Huang; C.K Wong 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 455 KB

Nearly optimal binary search trees

✍ Kurt Mehlhorn 📂 Article 📅 1975 🏛 Springer-Verlag 🌐 English ⚖ 329 KB

Multiple binary decision tree classifier

Multiple binary decision tree classifiers

✍ Seymour Shlien 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 565 KB

Multiple binary decision tree classifier

Multiple binary decision tree classifiers

✍ Seymour Shlien 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 565 KB

AMtract--Binary decision trees based on nonparametric statistical models of the data provide a solution to difficult decision problems where there are many classes and many available features related in a complex manner. Unfortunately, the technique requires a very large training set and is often li

Decision trees with optimal joint partit

Decision trees with optimal joint partitioning

✍ Djamel A. Zighed; Gilbert Ritschard; Walid Erray; Vasile-Marian Scuturici 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 544 KB

Decision tree methods generally suppose that the number of categories of the attribute to be predicted is fixed. Breiman et al., with their Twoing criterion in CART, considered gathering the categories of the predicted attribute into two supermodalities. In this article, we propose an extension of t