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-4zbMATH Open1346.68159OpenAlexW2052148895MaRDI QIDQ894696FDOQ894696
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
Recommendations
Cites Work
- Greedy function approximation: A gradient boosting machine.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Markov logic networks
- Title not available (Why is that?)
- 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: An Interface Layer for Artificial Intelligence
- Title not available (Why is that?)
- Structure learning of probabilistic logic programs by searching the clause space
- Title not available (Why is that?)
- Discriminative Structure Learning of Markov Logic Networks
Cited In (7)
- Non-parametric learning of embeddings for relational data using Gaifman locality theorem
- Learning Distributional Programs for Relational Autocompletion
- Approximate classification with web ontologies through evidential terminological trees and forests
- Transfer learning by mapping and revising boosted relational dependency networks
- Scalable learning and inference in Markov logic networks
- Lifted graphical models: a survey
- Online probabilistic theory revision from examples with ProPPR
Uses Software
This page was built for publication: Gradient-based boosting for statistical relational learning: the Markov logic network and missing data cases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q894696)