✦ LIBER ✦

On Learning Decision Trees with Large Output Domains

✍ Scribed by N. H. Bshouty; C. Tamon; D. K. Wilson

Book ID: 105746450
Publisher: Springer
Year: 1998
Tongue: English
Weight: 285 KB
Volume: 20
Category: Article
ISSN: 0178-4617
DOI: 10.1007/pl00009188

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Learning decision trees with taxonomy of

Learning decision trees with taxonomy of propositionalized attributes

✍ Dae-Ki Kang; Kiwook Sohn 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 918 KB

Lower Bounds on Learning Decision Lists

Lower Bounds on Learning Decision Lists and Trees

✍ Thomas Hancock; Tao Jiang; Ming Li; John Tromp 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 343 KB

Learning algorithms based on the constru

Learning algorithms based on the construction of decision trees

✍ V.I. Donskoi 📂 Article 📅 1982 🏛 Elsevier Science ⚖ 905 KB

Decision trees based on automatic learni

Decision trees based on automatic learning and their use in cardiology

✍ Peter Kokol; Marjan Mernik; Jernej Završnik; Kurt Kancler; Ivan Malčić 📂 Article 📅 1994 🏛 Springer US 🌐 English ⚖ 397 KB

Effective acoustic model clustering via

Effective acoustic model clustering via decision-tree with supervised learning

✍ Junho Park; Hanseok Ko 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 216 KB

On the Boosting Ability of Top–Down Deci

On the Boosting Ability of Top–Down Decision Tree Learning Algorithms

✍ Michael Kearns; Yishay Mansour 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 513 KB

We analyze the performance of top down algorithms for decision tree learning, such as those employed by the widely used C4.5 and CART software packages. Our main result is a proof that such algorithms are boosting algorithms. By this we mean that if the functions that label the internal nodes of the