Gradient-based boosting for statistical relational learning: the Markov logic network and missing data cases
From MaRDI portal
Publication:894696
DOI10.1007/s10994-015-5481-4zbMath1346.68159MaRDI QIDQ894696
Tushar Khot, Sriraam Natarajan, Kristian Kersting, Jude W. Shavlik
Publication date: 2 December 2015
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10994-015-5481-4
Related Items
Scalable learning and inference in Markov logic networks, Approximate classification with web ontologies through evidential terminological trees and forests, Transfer learning by mapping and revising boosted relational dependency networks, Lifted graphical models: a survey, Online probabilistic theory revision from examples with ProPPR
Uses Software
Cites Work
- Greedy function approximation: A gradient boosting machine.
- Gradient-based boosting for statistical relational learning: the relational dependency network case
- Learning first-order probabilistic models with combining rules
- Top-down induction of first-order logical decision trees
- Markov logic networks
- Discriminative Structure Learning of Markov Logic Networks
- Markov Logic: An Interface Layer for Artificial Intelligence
- Structure learning of probabilistic logic programs by searching the clause space
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item