Feature Discovery with Type Extension Trees

DOI10.1007/978-3-540-85928-4_13MaRDI QIDQ3543273zbMATH OpenOpenAlexFDO

Authors Paolo Frasconi, Manfred Jaeger, Andrea Passerini

Publication date 2 December 2008

Published in Inductive Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-85928-4_13

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Type extension trees for feature construction and learning in relational domains
• What kinds of relational features are useful for statistical learning?
• Relational information gain
• Estimating the importance of relational features by using gradient boosting
• Inductive Logic Programming

Cites work

• First order random forests: Learning relational classifiers with complex aggregates
• scientific article; zbMATH DE number 5296741 (Why is no real title available?)
• Top-down induction of first-order logical decision trees

Cited in

(8)

• Fast learning of relational kernels
• Estimating the importance of relational features by using gradient boosting
• Block-wise construction of tree-like relational features with monotone reducibility and redundancy
• Relational information gain
• scientific article; zbMATH DE number 1950776 (Why is no real title available?)
• kLog: a language for logical and relational learning with kernels
• Type extension trees for feature construction and learning in relational domains
• What kinds of relational features are useful for statistical learning?

This page was built for publication: Feature Discovery with Type Extension Trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3543273)