Adaptively learning probabilistic deterministic automata from data streams
From MaRDI portal
Recommendations
- Towards Feasible PAC-Learning of Probabilistic Deterministic Finite Automata
- scientific article; zbMATH DE number 5957212
- Learning probabilistic automata: a study in state distinguishability
- PAC-learnability of probabilistic deterministic finite state automata in terms of variation distance
- A lower bound for learning distributions generated by probabilistic automata
Cites work
- scientific article; zbMATH DE number 5957212 (Why is no real title available?)
- scientific article; zbMATH DE number 2019610 (Why is no real title available?)
- Adaptive stream mining: Pattern learning and mining from evolving data streams.
- Advanced Lectures on Machine Learning
- Algorithmic Learning Theory
- Data streams. Models and algorithms.
- Data streams: algorithms and applications.
- Database Theory - ICDT 2005
- Grammatical inference. Learning automata and grammars.
- Knowledge discovery from data streams.
- Learning deterministic regular grammars from stochastic samples in polynomial time
- Learning probabilistic automata: a study in state distinguishability
- Links between probabilistic automata and hidden Markov models: probability distributions, learning models and induction algorithms
- On the learnability and usage of acyclic probabilistic finite automata
- On the learnability of discrete distributions
- PAC-learnability of probabilistic deterministic finite state automata in terms of variation distance
- Towards Feasible PAC-Learning of Probabilistic Deterministic Finite Automata
Cited in
(2)
This page was built for publication: Adaptively learning probabilistic deterministic automata from data streams
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q479463)
