✦ LIBER ✦

Learning decision trees from random examples

✍ Scribed by Andrzej Ehrenfeucht; David Haussler

Book ID: 113383888
Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 890 KB
Volume: 82
Category: Article
ISSN: 0890-5401
DOI: 10.1016/0890-5401(89)90001-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Learning Random Log-Depth Decision Trees

Learning Random Log-Depth Decision Trees under Uniform Distribution

✍ Jackson, Jeffrey C.; Servedio, Rocco A. 📂 Article 📅 2005 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 268 KB

Learning fuzzy decision trees

✍ Bruno Apolloni; Giacomo Zamponi; Anna Maria Zanaboni 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 203 KB

We present a recurrent neural network which learns to suggest the next move during the descent along the branches of a decision tree. More precisely, given a decision instance represented by a node in the decision tree, the network provides the degree of membership of each possible move to the fuzzy

Learning probabilistic decision trees fo

Learning probabilistic decision trees for AUC

✍ Harry Zhang; Jiang Su 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 143 KB

Learning decision tree for ranking

✍ Liangxiao Jiang; Chaoqun Li; Zhihua Cai 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 325 KB

Word Sense Disambiguation by Learning De

Word Sense Disambiguation by Learning Decision Trees from Unlabeled Data

✍ Seong-Bae Park; Byoung-Tak Zhang; Yung Taek Kim 📂 Article 📅 2003 🏛 Springer US 🌐 English ⚖ 180 KB

Learning from Cluster Examples

✍ Toshihiro Kamishima; Fumio Motoyoshi 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 341 KB