Learning failure-free PRISM programs
From MaRDI portal
Recommendations
- New Advances in Logic-Based Probabilistic Modeling by PRISM
- CHR(PRISM)-based probabilistic logic learning
- Approximate Bayesian Computation for the Parameters of PRISM Programs
- Online Bayesian inference for the parameters of PRISM programs
- Variational Bayes via propositionalized probability computation in PRISM
Cites work
- scientific article; zbMATH DE number 1670726 (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 3349329 (Why is no real title available?)
- scientific article; zbMATH DE number 5180199 (Why is no real title available?)
- Biological Sequence Analysis
- Efficient approximations for the marginal likelihood of Bayesian networks with hidden variables
- Efficient learning of context-free grammars from positive structural examples
- Estimating the dimension of a model
- Large-sample learning of Bayesian networks is NP-hard
- Learning Bayesian networks: The combination of knowledge and statistical data
- Learning context-free grammars from structural data in polynomial time
- Learning non-stationary dynamic Bayesian networks
- Metaheuristics for Hard Optimization
- New Advances in Logic-Based Probabilistic Modeling by PRISM
- Online Bayesian inference for the parameters of PRISM programs
- Optimization by simulated annealing
- Parameter estimation in stochastic logic programs
- Unsupervised Learning of Probabilistic Context-Free Grammar using Iterative Biclustering
- Variational Bayes via propositionalized probability computation in PRISM
Cited in
(3)
This page was built for publication: Learning failure-free PRISM programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q900370)