Skip to main content
Article thumbnail
Location of Repository

Top-down induction of logical decision trees

By Hendrik Blockeel and Luc De Raedt

Abstract

Top-down induction of decision trees (TDIDT) is a very popular machine learning technique. Up till now, it has mainly been used for propositional learning, but seldomly for relational learning or inductive logic programming. The main contribution of this paper is the introduction of logical decision trees, which make it possible to use TDIDT in inductive logic programming. An implementation of this top-down induction of logical decision trees, the Tilde system, is presented and experimentally evaluated.

Year: 1998
OAI identifier: oai:CiteSeerX.psu:10.1.1.135.8361
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.informatik.uni-frei... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.