✦ LIBER ✦

Optimal dyadic decision trees

✍ Scribed by G. Blanchard; C. Schäfer; Y. Rozenholc; K.-R. Müller

Publisher: Springer
Year: 2007
Tongue: English
Weight: 885 KB
Volume: 66
Category: Article
ISSN: 0885-6125
DOI: 10.1007/s10994-007-0717-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Algorithms for optimal dyadic decision t

Algorithms for optimal dyadic decision trees

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

Approximating Optimal Binary Decision Tr

Approximating Optimal Binary Decision Trees

✍ Micah Adler; Brent Heeringa 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 389 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

On the optimization of fuzzy decision tr

On the optimization of fuzzy decision trees

✍ Xizhao Wang; Bin Chen; Guoliang Qian; Feng Ye 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 145 KB

Some combinatorial properties of dyadic

Some combinatorial properties of dyadic trees

✍ L.A. Khizder 📂 Article 📅 1966 🏛 Elsevier Science ⚖ 296 KB

H. Almuallim, An efficient algorithm for

H. Almuallim, An efficient algorithm for optimal of decision trees

📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 69 KB

Situations in which them is competition among possible contractor agents or possible manager agents are also considered. In all situations we assume that the contractor can choose a level of effort when carrying out the task and we would like the contractor to carry out the task efficiently without