Type extension trees for feature construction and learning in relational domains

DOI10.1016/J.ARTINT.2013.08.002MaRDI QIDQ490428zbMATH OpenOpenAlexWikidataFDO

Authors Manfred Jaeger, Marco Lippi, Andrea Passerini, Paolo Frasconi

Publication date 27 August 2015

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.artint.2013.08.002

zbMATH Keywords

statistical relational learninginductive logic programmingfeature discovery

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Logic programming (68N17)

Recommendations

• Feature Discovery with Type Extension Trees
• What kinds of relational features are useful for statistical learning?
• Estimating the importance of relational features by using gradient boosting
• Counts-of-counts similarity for prediction and search in relational data
• Inductive Logic Programming

Cites work

• scientific article; zbMATH DE number 5296741 (Why is no real title available?)
• scientific article; zbMATH DE number 53151 (Why is no real title available?)
• scientific article; zbMATH DE number 1875395 (Why is no real title available?)
• scientific article; zbMATH DE number 1897911 (Why is no real title available?)
• An index to quantify an individual's scientific research output
• Fast learning of relational kernels
• Feature Discovery with Type Extension Trees
• Finite model theory and its applications.
• First order random forests: Learning relational classifiers with complex aggregates
• Graph kernels
• Logical and Relational Learning
• Markov logic networks
• On graph kernels: hardness results and efficient alternatives.
• Probabilistic inductive logic programming. Theory and applications
• Relational information gain
• The Monge-Kantorovich problem: achievements, connections, and perspectives
• The earth mover's distance as a metric for image retrieval
• Top-down induction of first-order logical decision trees

Cited in

(3)

• Feature Discovery with Type Extension Trees
• Learning extended tree augmented naive structures
• Counts-of-counts similarity for prediction and search in relational data

Describes a project that uses

Uses Software

• EMD
• EigenRank
• ArnetMiner

This page was built for publication: Type extension trees for feature construction and learning in relational domains

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