Skip navigation
Skip navigation

Generalization behaviour of alkemic decision trees

Ng, Kee Siong

Description

This paper is concerned with generalization issues for a decision tree learner for structured data called ALKEMY. Motivated by error bounds established in statistical learning theory, we study the VC dimensions of some predicate classes defined on sets and multisets - two data-modelling constructs used intensively in the knowledge representation formalism of ALKEMY - and from that obtain insights into the (worst-case) generalization behaviour of the learner. The VC dimension results and the...[Show more]

CollectionsANU Research Publications
Date published: 2005
Type: Conference paper
URI: http://hdl.handle.net/1885/84329
Source: Inductive Logic Programming: Proceedings of the 15th International Conference on Inductive Logic Programming

Download

File Description SizeFormat Image
01_Ng_Generalization_behaviour_of_2005.pdf209.56 kBAdobe PDF    Request a copy


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  20 July 2017/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator