Title: First order random forests with complex aggregates
Authors: Vens, Celine ×
Van Assche, Anneleen
Blockeel, Hendrik
Dzeroski, Saso #
Issue Date: 2004
Publisher: Springer
Series Title: Lecture Notes in Computer Science vol:3194 pages:323-340
Conference: International Conference on Inductive Logic Programming edition:14 location:Porto, Portugal date:2004
Abstract: Random forest induction is a bagging method that randomly samples the feature set at each node in a decision tree. In propositional learning, the method has been shown to work well when lots of features are available. This certainly is the case in first order learning, especially when aggregate functions, combined with selection conditions on the set to be aggregated, are included in the feature space. In this paper, we introduce a random forest based approach to learning first order theories with aggregates. We experimentally validate and compare several variants: first order random forests without aggregates, with simple aggregates, and with complex aggregates in the feature set.
ISSN: 0302-9743
Publication status: published
KU Leuven publication type: IT
Appears in Collections:Informatics Section
× corresponding author
# (joint) last author

Files in This Item:
File Status SizeFormat
ILP04.pdf Published 244KbAdobe PDFView/Open


All items in Lirias are protected by copyright, with all rights reserved.

© Web of science