A comparison of collapsed Bayesian methods for probabilistic finite automata
- Author
- SHIBATA, Chihiro1 ; YOSHINAKA, Ryo2
[1] School of Computer Science, Tokyo University of Technology, Tokyo, Japan
[2] Graduate School of Informatics, Kyoto University, Kyoto, Japan - Issue title
- Special Issue on Grammatical Inference
- Author (monograph)
- HEINZ, Jeffrey (Editor)1 ; DE LA HIGUERA, C (Editor)2 ; OATES, Tim (Editor)3
[1] University of Delaware, Newark, United States
[2] Laboratoire d'Informatique de Nantes Atlantique, University of Nantes, Nantes, France
[3] University of Maryland Baltimore County, Baltimore, United States - Source
Machine learning. 2014, Vol 96, Num 1-2, pp 155-188, 34 p ; ref : 1 p
- ISSN
- 0885-6125
- Scientific domain
- Cognition; Computer science
- Publisher
- Springer, Heidelberg
- Publication country
- Germany
- Document type
- Article
- Language
- English
- Author keyword
- Collapsed Gibbs sampling State-merging algorithms Variational Bayesian methods
- Keyword (fr)
- Algorithme approximation Apprentissage probabilités Automate déterministe Automate fini Automate probabiliste Compétition Echantillonnage Gibbs Estimation Bayes Intelligence artificielle Modèle Markov caché Probabilité transition Type donnée
- Keyword (en)
- Approximation algorithm Probability learning Deterministic automaton Finite automaton Probabilistic automaton Competition Gibbs sampling Bayes estimation Artificial intelligence Hidden Markov model Transition probability Data type
- Keyword (es)
- Algoritmo aproximación Aprendizaje probabilidades Autómata determinista Autómata estado finito Autómata probabilista Competencia Muestreo Gibbs Estimación Bayes Inteligencia artificial Modelo Markov oculto Probabilidad transición Tipo dato
- Classification
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02A Theoretical computing / 001D02A05 Algorithmics. Computability. Computer arithmetics
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02A Theoretical computing / 001D02A06 Information retrieval. Graph
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02C Artificial intelligence
- Discipline
- Computer science : theoretical automation and systems
- Origin
- Inist-CNRS
- Database
- PASCAL
- INIST identifier
- 28595234
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Access to the document
Install on your browser
DOI
10.1007/s10994-013-5410-3 
https://dx.doi.org/10.1007/s10994-013-5410-3
"O:13:\"PanistOpenUrl\":36:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000idc\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1007\/s10994-013-5410-3\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:76:\"A comparison of collapsed Bayesian methods for probabilistic finite automata\";s:9:\"\u0000*\u0000jtitle\";s:16:\"Machine learning\";s:9:\"\u0000*\u0000stitle\";s:11:\"Mach. learn\";s:7:\"\u0000*\u0000date\";s:4:\"2014\";s:9:\"\u0000*\u0000volume\";s:2:\"96\";s:8:\"\u0000*\u0000issue\";s:3:\"1-2\";s:8:\"\u0000*\u0000spage\";s:3:\"155\";s:8:\"\u0000*\u0000epage\";s:3:\"188\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0885-6125\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:7:\"SHIBATA\";s:10:\"\u0000*\u0000aufirst\";s:7:\"Chihiro\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:14:\"YOSHINAKA, Ryo\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:38:\"Special Issue on Grammatical Inference\";s:8:\"\u0000*\u0000title\";s:76:\"A comparison of collapsed Bayesian methods for probabilistic finite automata\";s:8:\"\u0000*\u0000place\";s:10:\"Heidelberg\";s:6:\"\u0000*\u0000pub\";s:8:\"Springer\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"34\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Panist access
"O:12:\"IstexOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1007\/s10994-013-5410-3\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:76:\"A comparison of collapsed Bayesian methods for probabilistic finite automata\";s:9:\"\u0000*\u0000jtitle\";s:16:\"Machine learning\";s:9:\"\u0000*\u0000stitle\";s:11:\"Mach. learn\";s:7:\"\u0000*\u0000date\";s:4:\"2014\";s:9:\"\u0000*\u0000volume\";s:2:\"96\";s:8:\"\u0000*\u0000issue\";s:3:\"1-2\";s:8:\"\u0000*\u0000spage\";s:3:\"155\";s:8:\"\u0000*\u0000epage\";s:3:\"188\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0885-6125\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:7:\"SHIBATA\";s:10:\"\u0000*\u0000aufirst\";s:7:\"Chihiro\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:14:\"YOSHINAKA, Ryo\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:38:\"Special Issue on Grammatical Inference\";s:8:\"\u0000*\u0000title\";s:76:\"A comparison of collapsed Bayesian methods for probabilistic finite automata\";s:8:\"\u0000*\u0000place\";s:10:\"Heidelberg\";s:6:\"\u0000*\u0000pub\";s:8:\"Springer\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"34\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Istex access
"O:16:\"UnpaywallOpenUrl\":35:{s:8:\"\u0000*\u0000email\";s:27:\"assistance-portail@inist.fr\";s:6:\"\u0000*\u0000fmt\";N;s:6:\"\u0000*\u0000doi\";s:25:\"10.1007\/s10994-013-5410-3\";s:6:\"\u0000*\u0000pii\";N;s:7:\"\u0000*\u0000pmid\";N;s:9:\"\u0000*\u0000atitle\";N;s:9:\"\u0000*\u0000jtitle\";N;s:9:\"\u0000*\u0000stitle\";N;s:7:\"\u0000*\u0000date\";N;s:9:\"\u0000*\u0000volume\";N;s:8:\"\u0000*\u0000issue\";N;s:8:\"\u0000*\u0000spage\";N;s:8:\"\u0000*\u0000epage\";N;s:8:\"\u0000*\u0000pages\";N;s:7:\"\u0000*\u0000issn\";N;s:8:\"\u0000*\u0000eissn\";N;s:9:\"\u0000*\u0000aulast\";N;s:10:\"\u0000*\u0000aufirst\";N;s:9:\"\u0000*\u0000auinit\";N;s:10:\"\u0000*\u0000auinitm\";N;s:5:\"\u0000*\u0000au\";N;s:9:\"\u0000*\u0000aucorp\";N;s:7:\"\u0000*\u0000isbn\";N;s:8:\"\u0000*\u0000coden\";N;s:8:\"\u0000*\u0000genre\";N;s:7:\"\u0000*\u0000part\";N;s:9:\"\u0000*\u0000btitle\";N;s:8:\"\u0000*\u0000title\";N;s:8:\"\u0000*\u0000place\";N;s:6:\"\u0000*\u0000pub\";N;s:10:\"\u0000*\u0000edition\";N;s:9:\"\u0000*\u0000tpages\";N;s:9:\"\u0000*\u0000series\";N;s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";N;}"
Unpaywall access
"O:16:\"EuropePMCOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1007\/s10994-013-5410-3\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:76:\"A comparison of collapsed Bayesian methods for probabilistic finite automata\";s:9:\"\u0000*\u0000jtitle\";s:16:\"Machine learning\";s:9:\"\u0000*\u0000stitle\";s:11:\"Mach. learn\";s:7:\"\u0000*\u0000date\";s:4:\"2014\";s:9:\"\u0000*\u0000volume\";s:2:\"96\";s:8:\"\u0000*\u0000issue\";s:3:\"1-2\";s:8:\"\u0000*\u0000spage\";s:3:\"155\";s:8:\"\u0000*\u0000epage\";s:3:\"188\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0885-6125\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:7:\"SHIBATA\";s:10:\"\u0000*\u0000aufirst\";s:7:\"Chihiro\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:14:\"YOSHINAKA, Ryo\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:38:\"Special Issue on Grammatical Inference\";s:8:\"\u0000*\u0000title\";s:76:\"A comparison of collapsed Bayesian methods for probabilistic finite automata\";s:8:\"\u0000*\u0000place\";s:10:\"Heidelberg\";s:6:\"\u0000*\u0000pub\";s:8:\"Springer\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"34\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Europe PubMed Central access
"O:11:\"BaseOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1007\/s10994-013-5410-3\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:76:\"A comparison of collapsed Bayesian methods for probabilistic finite automata\";s:9:\"\u0000*\u0000jtitle\";s:16:\"Machine learning\";s:9:\"\u0000*\u0000stitle\";s:11:\"Mach. learn\";s:7:\"\u0000*\u0000date\";s:4:\"2014\";s:9:\"\u0000*\u0000volume\";s:2:\"96\";s:8:\"\u0000*\u0000issue\";s:3:\"1-2\";s:8:\"\u0000*\u0000spage\";s:3:\"155\";s:8:\"\u0000*\u0000epage\";s:3:\"188\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0885-6125\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:7:\"SHIBATA\";s:10:\"\u0000*\u0000aufirst\";s:7:\"Chihiro\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:14:\"YOSHINAKA, Ryo\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:38:\"Special Issue on Grammatical Inference\";s:8:\"\u0000*\u0000title\";s:76:\"A comparison of collapsed Bayesian methods for probabilistic finite automata\";s:8:\"\u0000*\u0000place\";s:10:\"Heidelberg\";s:6:\"\u0000*\u0000pub\";s:8:\"Springer\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"34\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Base Search access
"O:12:\"ArXivOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1007\/s10994-013-5410-3\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:76:\"A comparison of collapsed Bayesian methods for probabilistic finite automata\";s:9:\"\u0000*\u0000jtitle\";s:16:\"Machine learning\";s:9:\"\u0000*\u0000stitle\";s:11:\"Mach. learn\";s:7:\"\u0000*\u0000date\";s:4:\"2014\";s:9:\"\u0000*\u0000volume\";s:2:\"96\";s:8:\"\u0000*\u0000issue\";s:3:\"1-2\";s:8:\"\u0000*\u0000spage\";s:3:\"155\";s:8:\"\u0000*\u0000epage\";s:3:\"188\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0885-6125\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:7:\"SHIBATA\";s:10:\"\u0000*\u0000aufirst\";s:7:\"Chihiro\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:14:\"YOSHINAKA, Ryo\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:38:\"Special Issue on Grammatical Inference\";s:8:\"\u0000*\u0000title\";s:76:\"A comparison of collapsed Bayesian methods for probabilistic finite automata\";s:8:\"\u0000*\u0000place\";s:10:\"Heidelberg\";s:6:\"\u0000*\u0000pub\";s:8:\"Springer\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"34\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
arXiv access
