Type extension trees for feature construction and learning in relational domains
From MaRDI portal
Publication:490428
DOI10.1016/J.ARTINT.2013.08.002zbMATH Open1334.68186OpenAlexW2134768353WikidataQ62695798 ScholiaQ62695798MaRDI QIDQ490428FDOQ490428
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
Recommendations
Cites Work
- The earth mover's distance as a metric for image retrieval
- An index to quantify an individual's scientific research output
- Graph kernels
- Title not available (Why is that?)
- The Monge-Kantorovich problem: achievements, connections, and perspectives
- Probabilistic inductive logic programming. Theory and applications
- Markov logic networks
- Title not available (Why is that?)
- On graph kernels: hardness results and efficient alternatives.
- Finite model theory and its applications.
- Logical and Relational Learning
- Top-down induction of first-order logical decision trees
- First order random forests: Learning relational classifiers with complex aggregates
- Feature Discovery with Type Extension Trees
- Relational information gain
- Title not available (Why is that?)
- Fast learning of relational kernels
- Title not available (Why is that?)
Cited In (3)
Uses Software
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)