Links between probabilistic automata and hidden Markov models: probability distributions, learning models and induction algorithms
From MaRDI portal
Publication:2485074
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
Cites work
- scientific article; zbMATH DE number 1670712 (Why is no real title available?)
- scientific article; zbMATH DE number 1670719 (Why is no real title available?)
- scientific article; zbMATH DE number 3731374 (Why is no real title available?)
- scientific article; zbMATH DE number 41243 (Why is no real title available?)
- scientific article; zbMATH DE number 107482 (Why is no real title available?)
- scientific article; zbMATH DE number 3567782 (Why is no real title available?)
- scientific article; zbMATH DE number 3596271 (Why is no real title available?)
- scientific article; zbMATH DE number 1179314 (Why is no real title available?)
- scientific article; zbMATH DE number 2019596 (Why is no real title available?)
- scientific article; zbMATH DE number 3371972 (Why is no real title available?)
- scientific article; zbMATH DE number 3402108 (Why is no real title available?)
- A Maximization Technique Occurring in the Statistical Analysis of Probabilistic Functions of Markov Chains
- A learning criterion for stochastic rules
- A solution of the syntactical induction-inference problem for regular languages
- A theory of the learnable
- Bioinformatics. The machine learning approach.
- Biological Sequence Analysis
- Efficient distribution-free learning of probabilistic concepts
- Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
- Grammatical Inference: Introduction and Survey - Part I
- Grammatical Inference: Introduction and Survey - Part II
- Language identification in the limit
- Learning deterministic regular grammars from stochastic samples in polynomial time
- Learning fallible deterministic finite automata
- Minimum complexity density estimation
- On stochastic context-free languages
- On the computational complexity of approximating distributions by probabilistic automata
- On the inference of stochastic regular grammars
- On the learnability of discrete distributions
- Probability Inequalities for Sums of Bounded Random Variables
- Recent advances of grammatical inference
- Syntactic methods in pattern recognition
- The power of amnesia: Learning probabilistic automata with variable memory length
Cited in
(20)- Improving hospital layout planning through clinical pathway mining
- Learning weighted automata
- Links between multiplicity automata, observable operator models and predictive state representations -- a unified learning framework
- PAC-learnability of probabilistic deterministic finite state automata in terms of variation distance
- Learning probability distributions generated by finite-state machines
- Fitting probabilistic automata via the em algorithm
- Learning probabilistic automata using residuals
- Mining probabilistic automata: a statistical view of sequential pattern mining
- Calibrating generative models: the probabilistic Chomsky-Schützenberger hierarchy
- Theoretical computer science: computational complexity
- Efficiently identifying deterministic real-time automata from labeled data
- ptype: probabilistic type inference
- Regular expressions for decoding of neural network outputs
- Positive neural networks in discrete time implement monotone-regular behaviors
- A comprehensive survey and analysis of generative models in machine learning
- scientific article; zbMATH DE number 1670712 (Why is no real title available?)
- 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
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)
