First order random forests: Learning relational classifiers with complex aggregates

DOI10.1007/s10994-006-8713-9zbMath1103.68732OpenAlexW2060866626WikidataQ58012291 ScholiaQ58012291MaRDI QIDQ2433184

Sašo Džeroski, Anneleen Van Assche, Celine Vens, Hendrik Blockeel

Publication date: 27 October 2006

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10994-006-8713-9

zbMATH Keywords

aggregationrandom forestsrelational learningdecision tree learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items

Learning directed probabilistic logical models: Ordering-search versus structure-search ⋮ Approximate classification with web ontologies through evidential terminological trees and forests ⋮ Relational information gain ⋮ Gradient-based boosting for statistical relational learning: the relational dependency network case ⋮ A comparison of pruning criteria for probability trees ⋮ Counts-of-counts similarity for prediction and search in relational data ⋮ Feature Discovery with Type Extension Trees ⋮ Type extension trees for feature construction and learning in relational domains ⋮ Seeing the Forest Through the Trees

Uses Software

• Aleph
• C4.5

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bagging predictors
• Top-down induction of first-order logical decision trees
• Technical note: Some properties of splitting criteria
• Improved boosting algorithms using confidence-rated predictions
• Boosting first-order learning
• Pattern Recognition as Rule-Guided Inductive Inference
• Inductive Logic Programming
• Robust classification for imprecise environments
• Random forests