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

DOI10.1016/j.patcog.2004.03.020zbMath1101.68651OpenAlexW2001179000MaRDI QIDQ2485074

Yanyan Li

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

zbMATH Keywords

Bayesian learningPAC learningProbabilistic automataHidden Markov modelsGrammar inductionHMM topology learningInduction algorithms

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (15)

Learning probabilistic automata using residuals ⋮ Improving hospital layout planning through clinical pathway mining ⋮ Quantifying the generalization capacity of Markov models for melody prediction ⋮ Calibrating generative models: the probabilistic Chomsky-Schützenberger hierarchy ⋮ Learning Weighted Automata ⋮ Regular expressions for decoding of neural network outputs ⋮ Efficiently identifying deterministic real-time automata from labeled data ⋮ Learning Probability Distributions Generated by Finite-State Machines ⋮ Mining probabilistic automata: a statistical view of sequential pattern mining ⋮ Positive Neural Networks in Discrete Time Implement Monotone-Regular Behaviors ⋮ Adaptively learning probabilistic deterministic automata from data streams ⋮ \textsc{PAutomaC}: a probabilistic automata and hidden Markov models learning competition ⋮ PAC-learnability of probabilistic deterministic finite state automata in terms of variation distance ⋮ ptype: probabilistic type inference ⋮ A comprehensive survey and analysis of generative models in machine learning

Cites Work

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

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