A universal data compression system
From MaRDI portal
Publication:3671882
DOI10.1109/TIT.1983.1056741zbMATH Open0521.94010WikidataQ60620401 ScholiaQ60620401MaRDI QIDQ3671882FDOQ3671882
Publication date: 1983
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
model complexityrandom fieldmodelinglong stringsminimum description lengthdata compression algorithmtest of randomness
Parametric inference (62F99) Statistical methods; economic indices and measures (91B82) Source coding (94A29)
Cited In (60)
- Title not available (Why is that?)
- Computation of exact probabilities associated with overlapping pattern occurrences
- Four billion years: the story of an ancient protein family
- Variable length Markov chain with exogenous covariates
- Convergence to equilibrium for time-inhomogeneous jump diffusions with state-dependent jump intensity
- Using a VOM model for reconstructing potential coding regions in EST sequences
- Efficient and adaptive post-model-selection estimators
- Chains of infinite order, chains with memory of variable length, and maps of the interval
- Variable length local decoding and alignment-free sequence comparison
- Phase transition for infinite systems of spiking neurons
- Infinite systems of interacting chains with memory of variable length -- a stochastic model for biological neural nets
- Bayesian analysis of variable-order, reversible Markov chains
- Estimating the interaction graph of stochastic neuronal dynamics by observing only pairs of neurons
- Rule generation for categorical time series with Markov assumptions
- Limit theorems for chains with unbounded variable length memory which satisfy Cramer condition
- Joint Estimation of Intersecting Context Tree Models
- Relevant states and memory in Markov chain bootstrapping and simulation
- Exponential inequalities for VLMC empirical trees
- Probability and algorithmics: a focus on some recent developments
- Lossless compression of map contours by context tree modeling of chain codes
- Distributions of pattern statistics in sparse Markov models
- Uncommon suffix tries
- Persistent random walks. I. Recurrence versus transience
- Context tree selection: a unifying view
- Context tree selection and linguistic rhythm retrieval from written texts
- A copula-based partition Markov procedure
- On the Mathematical Consequences of Binning Spike Trains
- Sparse Markov chains for sequence data
- Stochastically perturbed chains of variable memory
- Context Trees, Variable Length Markov Chains and Dynamical Sources
- Measuring the efficiency of the intraday Forex market with a universal data compression algorithm
- Local theorems for (multidimensional) additive functionals of semi-Markov chains
- Bootstraps for time series
- Robust Model Selection for Stochastic Processes
- The power of amnesia: Learning probabilistic automata with variable memory length
- Coupling and perturbation techniques for categorical time series
- Stratified graphical models -- context-specific independence in graphical models
- Nonparametric statistical inference for the context tree of a stationary ergodic process
- Detecting renewal states in chains of variable length via intrinsic Bayes factors
- Perfect simulation of processes with long memory: A “coupling into and from the past” algorithm
- Divergent Perpetuities Modulated by Regime Switches
- Entropic repulsion and lack of the \(g\)-measure property for Dyson models
- Context-Specific and Local Independence in Markovian Dependence Structures
- Almost Gibbsianness and parsimonious description of the decimated 2d-Ising model
- A framework for space-efficient string kernels
- Partially observed Markov random fields are variable neighborhood random fields
- Variable length memory chains: characterization of stationary probability measures
- A Note on Distinguishing Random Trees Populations
- Neighborhood radius estimation for variable-neighborhood random fields
- Online portfolio selection
- Entropy estimation of symbol sequences
- On-line maximum likelihood prediction with respect to general loss functions
- Some upper bounds for the rate of convergence of penalized likelihood context tree estimators
- Algorithms for learning parsimonious context trees
- Recursive learning for sparse Markov models
- Testing statistical hypothesis on random trees and applications to the protein classification problem
- Non-regular g-measures and variable length memory chains
- From data to stochastic models
- Chains with unbounded variable length memory: perfect simulation and a visible regeneration scheme
- Variable length Markov chains
This page was built for publication: A universal data compression system
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3671882)