Links between probabilistic automata and hidden Markov models: probability distributions, learning models and induction algorithms

DOI10.1016/J.PATCOG.2004.03.020zbMATH Open1101.68651OpenAlexW2001179000MaRDI QIDQ2485074FDOQ2485074

Publication date: 3 August 2005

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.patcog.2004.03.020

Recommendations

Learning probabilistic automata and Markov chains via queries
Learning probabilistic automata: a study in state distinguishability
Learning Theory
\textsc{PAutomaC}: a probabilistic automata and hidden Markov models learning competition
Learning deterministic probabilistic automata from a model checking perspective
Hidden semi-Markov models. Theory, algorithms and applications
scientific article; zbMATH DE number 2019610
On the learnability and usage of acyclic probabilistic finite automata
A lower bound for learning distributions generated by probabilistic automata
Hidden Markov models and applications

Bayesian learning PAC learning Probabilistic automata Hidden Markov models Grammar induction HMM topology learning Induction algorithms

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Biological Sequence Analysis
Title not available (Why is that?)
Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
Probability Inequalities for Sums of Bounded Random Variables
A Maximization Technique Occurring in the Statistical Analysis of Probabilistic Functions of Markov Chains
Bioinformatics. The machine learning approach.
Minimum complexity density estimation
On the learnability of discrete distributions
Title not available (Why is that?)
Language identification in the limit
A theory of the learnable
Title not available (Why is that?)
Learning deterministic regular grammars from stochastic samples in polynomial time
A learning criterion for stochastic rules
Syntactic methods in pattern recognition
Efficient distribution-free learning of probabilistic concepts
Recent advances of grammatical inference
On the computational complexity of approximating distributions by probabilistic automata
The power of amnesia: Learning probabilistic automata with variable memory length
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Grammatical Inference: Introduction and Survey - Part I
Title not available (Why is that?)
Grammatical Inference: Introduction and Survey - Part II
A solution of the syntactical induction-inference problem for regular languages
On stochastic context-free languages
Learning fallible deterministic finite automata
Title not available (Why is that?)
On the inference of stochastic regular grammars

Cited In (20)

Calibrating generative models: the probabilistic Chomsky-Schützenberger hierarchy
ptype: probabilistic type inference
PAC-learnability of probabilistic deterministic finite state automata in terms of variation distance
Learning probabilistic automata using residuals
Efficiently identifying deterministic real-time automata from labeled data
Mining probabilistic automata: a statistical view of sequential pattern mining
Improving hospital layout planning through clinical pathway mining
Theoretical computer science: computational complexity
Learning weighted automata
Links between multiplicity automata, observable operator models and predictive state representations -- a unified learning framework
Title not available (Why is that?)
Quantifying the generalization capacity of Markov models for melody prediction
\textsc{PAutomaC}: a probabilistic automata and hidden Markov models learning competition
A comparison of collapsed Bayesian methods for probabilistic finite automata
Adaptively learning probabilistic deterministic automata from data streams
Learning probability distributions generated by finite-state machines
Fitting probabilistic automata via the em algorithm
Positive neural networks in discrete time implement monotone-regular behaviors
A comprehensive survey and analysis of generative models in machine learning
Regular expressions for decoding of neural network outputs

This page was built for publication: Links between probabilistic automata and hidden Markov models: probability distributions, learning models and induction algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2485074)