✦ LIBER ✦

Minimax-optimal classification with dyadic decision trees

✍ Scribed by Scott, C.; Nowak, R.D.

Book ID: 114639170
Publisher: IEEE
Year: 2006
Tongue: English
Weight: 557 KB
Volume: 52
Category: Article
ISSN: 0018-9448
DOI: 10.1109/tit.2006.871056

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

Algorithms for optimal dyadic decision t

Algorithms for optimal dyadic decision trees

✍ Don Hush; Reid Porter 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 585 KB

Classification trees with optimal multiv

Classification trees with optimal multivariate decision nodes

✍ Donald E. Brown; Clarence Louis Pittard; Han Park 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 380 KB

Globally optimal fuzzy decision trees fo

Globally optimal fuzzy decision trees for classification and regression

✍ Suarez, A.; Lutsko, J.F. 📂 Article 📅 1999 🏛 IEEE 🌐 English ⚖ 909 KB

IMPRECISE CLASSIFICATION WITH CREDAL DEC

IMPRECISE CLASSIFICATION WITH CREDAL DECISION TREES

✍ ABELLÁN, JOAQUÍN; MASEGOSA, ANDRÉS R. 📂 Article 📅 2012 🏛 World Scientific Publishing Company 🌐 English ⚖ 339 KB

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