Viterbi training in PRISM
From MaRDI portal
Publication:4592976
DOI10.1017/S1471068413000677zbMath1379.68272arXiv1303.5659MaRDI QIDQ4592976
Publication date: 9 November 2017
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1303.5659
Related Items (4)
Symbolic DNN-tuner ⋮ Lifted discriminative learning of probabilistic logic programs ⋮ PRISM revisited: declarative implementation of a probabilistic programming language using multi-prompt delimited control ⋮ Learning to rank in PRISM
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Variational Bayes via propositionalized probability computation in PRISM
- Bayesian network classifiers
- Not so naive Bayes: Aggregating one-dependence estimators
- Probabilistic inductive logic programming. Theory and applications
- The PITA system: Tabling and answer subsumption for reasoning under uncertainty
- The segmental K-means algorithm for estimating parameters of hidden Markov models
- A computationally efficient approach to the estimation of two- and three-dimensional hidden Markov models
- Evaluating Learning Algorithms
- ADJUSTED VITERBI TRAINING
- Linear tabling strategies and optimizations
- Probabilistic Inductive Logic Programming
- On the Efficient Execution of ProbLog Programs
This page was built for publication: Viterbi training in PRISM