Generalization behaviour of alkemic decision trees
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]
|Collections||ANU Research Publications|
|Source:||Inductive Logic Programming: Proceedings of the 15th International Conference on Inductive Logic Programming|
|01_Ng_Generalization_behaviour_of_2005.pdf||209.56 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.