A comparison of collapsed Bayesian methods for probabilistic finite automata

DOI10.1007/S10994-013-5410-3zbMath1317.68101OpenAlexW1976027977MaRDI QIDQ479467

Ryo Yoshinaka, Chihiro Shibata

Publication date: 5 December 2014

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10994-013-5410-3

zbMATH Keywords

collapsed Gibbs samplingstate-merging algorithmsvariational Bayesian methods

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45)

Uses Software

• L-BFGS-B
• L-BFGS
• LBFGS-B
• PRMLT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the computational complexity of approximating distributions by probabilistic automata
• Learning probabilistic automata: a study in state distinguishability
• On the learnability of discrete distributions
• Hierarchical Dirichlet Processes
• Towards Feasible PAC-Learning of Probabilistic Deterministic Finite Automata
• Algorithm 778: L-BFGS-B

This page was built for publication: A comparison of collapsed Bayesian methods for probabilistic finite automata