Adaptively learning probabilistic deterministic automata from data streams

DOI10.1007/s10994-013-5408-xzbMath1317.68089OpenAlexW2006988199MaRDI QIDQ479463

Borja Balle, Ricard Gavaldà, Jorge E. Castro

Publication date: 5 December 2014

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10994-013-5408-x

zbMATH Keywords

PAC learningprobabilistic automatadata streamsPDFAstream sketches

Mathematics Subject Classification ID

Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45)

Related Items (1)

Kappa updated ensemble for drifting data stream mining

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the learnability and usage of acyclic probabilistic finite automata
• Learning probabilistic automata: a study in state distinguishability
• Data streams. Models and algorithms.
• PAC-learnability of probabilistic deterministic finite state automata in terms of variation distance
• Links between probabilistic automata and hidden Markov models: probability distributions, learning models and induction algorithms
• On the learnability of discrete distributions
• Knowledge Discovery from Data Streams
• Towards Feasible PAC-Learning of Probabilistic Deterministic Finite Automata
• Learning deterministic regular grammars from stochastic samples in polynomial time
• Database Theory - ICDT 2005
• Algorithmic Learning Theory
• Advanced Lectures on Machine Learning

This page was built for publication: Adaptively learning probabilistic deterministic automata from data streams