The power of amnesia: Learning probabilistic automata with variable memory length
From MaRDI portal
Publication:676238
DOI10.1007/BF00114008zbMath0869.68066WikidataQ99980068 ScholiaQ99980068MaRDI QIDQ676238
Yoram Singer, Dana Ron, Naftali Tishby
Publication date: 20 August 1997
Published in: Machine Learning (Search for Journal in Brave)
Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45)
Related Items (20)
Analysing grouping of nucleotides in DNA sequences using lumped processes constructed from Markov chains ⋮ Probabilistic suffix models for API sequence analysis of windows XP applications ⋮ Recurrent Neural Networks with Small Weights Implement Definite Memory Machines ⋮ Learning invariant features using inertial priors ⋮ Organization of the state space of a simple recurrent network before and after training on recursive linguistic structures ⋮ KIS: An automated attribute induction method for classification of DNA sequences ⋮ A framework for space-efficient string kernels ⋮ Learning deterministic probabilistic automata from a model checking perspective ⋮ Detecting renewal states in chains of variable length via intrinsic Bayes factors ⋮ Incorporating linguistic structure into maximum entropy language models ⋮ Context tree selection and linguistic rhythm retrieval from written texts ⋮ Dimensionality reduction and topographic mapping of binary tensors ⋮ Learning Probability Distributions Generated by Finite-State Machines ⋮ Textual data compression in computational biology: algorithmic techniques ⋮ The power of amnesia: Learning probabilistic automata with variable memory length ⋮ Rule generation for categorical time series with Markov assumptions ⋮ Links between probabilistic automata and hidden Markov models: probability distributions, learning models and induction algorithms ⋮ A general framework for modeling memory in capture-recapture data ⋮ Testing statistical hypothesis on random trees and applications to the protein classification problem ⋮ Distributions of pattern statistics in sparse Markov models
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The power of amnesia: Learning probabilistic automata with variable memory length
- Eigenvalue bounds on convergence to stationarity for nonreversible Markov chains, with an application to the exclusion process
- On the computational complexity of approximating distributions by probabilistic automata
- On the learnability and usage of acyclic probabilistic finite automata
- Discrete sequence prediction and its applications
- On the learnability of discrete distributions
- Prediction and Entropy of Printed English
- A universal data compression system
- Complexity of strings in the class of Markov sources
- A sequential algorithm for the universal coding of finite memory sources
- Compression of individual sequences via variable-rate coding
- Optimal Prediction for Prefetching in the Worst Case
- Learning Decision Trees Using the Fourier Spectrum
- The context-tree weighting method: basic properties
- Efficient learning of typical finite automata from random walks
- A Maximization Technique Occurring in the Statistical Analysis of Probabilistic Functions of Markov Chains
- Fast Sequential Decoding Algorithm Using a Stack
This page was built for publication: The power of amnesia: Learning probabilistic automata with variable memory length
