✦ LIBER ✦

Top-down induction of first-order logical decision trees

✍ Scribed by Hendrik Blockeel; Luc De Raedt

Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 895 KB
Volume: 101
Category: Article
ISSN: 0004-3702
DOI: 10.1016/s0004-3702(98)00034-4

No coin nor oath required. For personal study only.

✦ Synopsis

A first-order framework for top-down induction of logical decision trees is introduced. The expressivity of these trees is shown to be larger than that of the flat logic programs which are typically induced by classical ILP systems, and equal to that of first-order decision lists. These results are related to predicate invention and mixed variable quantification. Finally, an implementation of this framework, the TILDE system, is presented and empirically evaluated.

📜 SIMILAR VOLUMES

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

Polychotomous kernel Fisher discriminant

Polychotomous kernel Fisher discriminant via top–down induction of binary tree

✍ Zhao Lu; Lily Rui Liang; Gangbing Song; Shufang Wang 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 358 KB

In spite of the popularity of Fisher discriminant analysis in the realm of feature extraction and pattern classification, it is beyond the capability of Fisher discriminant analysis to extract nonlinear structures from the data. That is where the kernel Fisher discriminant algorithm sets in the scen