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