Learning first-order probabilistic models with combining rules
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5296741 (Why is no real title available?)
- scientific article; zbMATH DE number 3567782 (Why is no real title available?)
- scientific article; zbMATH DE number 1753155 (Why is no real title available?)
- scientific article; zbMATH DE number 1875392 (Why is no real title available?)
- scientific article; zbMATH DE number 1392295 (Why is no real title available?)
- A Relational Hierarchical Model for Decision-Theoretic Assistance
- Adaptive probabilistic networks with hidden variables
- Efficient computation for the noisy MAX
- Inductive Logic Programming
- MEBN: a language for first-order Bayesian knowledge bases
- Noisy-or classifier
- PRL: a probabilistic relational language
- Probabilistic Horn abduction and Bayesian networks
- The elements of statistical learning. Data mining, inference, and prediction
Cited in
(10)- scientific article; zbMATH DE number 7307476 (Why is no real title available?)
- Combining Clauses with Various Precisions and Recalls to Produce Accurate Probabilistic Estimates
- Learning Distributional Programs for Relational Autocompletion
- Exploiting symmetries for scaling loopy belief propagation and relational training
- Leveraging cluster backbones for improving MAP inference in statistical relational models
- Gradient-based boosting for statistical relational learning: the Markov logic network and missing data cases
- Structure learning for relational logistic regression: an ensemble approach
- Gradient-based boosting for statistical relational learning: the relational dependency network case
- 10.1162/153244304773633834
- Fast learning of relational dependency networks
This page was built for publication: Learning first-order probabilistic models with combining rules
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q841645)