The context-tree weighting method: basic properties
From MaRDI portal
Publication:4836892
DOI10.1109/18.382012zbMath0837.94011OpenAlexW2163294786WikidataQ105584733 ScholiaQ105584733MaRDI QIDQ4836892
Tj. J. Tjalkens, Frans M. J. Willems, Yu. M. Shtar'kov
Publication date: 27 May 1996
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://research.tue.nl/nl/publications/de5cf619-a613-40ca-b686-6acb44a6bd85
Related Items (42)
Generative Exponential Smoothing and Generative ARMA Models to Forecast Time-Variant Rates or Probabilities ⋮ Entropy estimation of symbol sequences ⋮ Generalization bounds for averaged classifiers ⋮ Thermodynamic Gibbs Formalism and Information Theory ⋮ Sparse Markov Chains for Sequence Data ⋮ Sublinear algorithms for approximating string compressibility ⋮ Direct comparison of agent-based models of herding in financial markets ⋮ A comparison of economic agent-based model calibration methods ⋮ A philosophical treatise of universal induction ⋮ Detecting renewal states in chains of variable length via intrinsic Bayes factors ⋮ Predicting a binary sequence almost as well as the optimal biased coin ⋮ Context tree selection and linguistic rhythm retrieval from written texts ⋮ Modifying a simple agent-based model to disentangle the microstructure of Chinese and US stock markets ⋮ Buy low, sell high ⋮ A Continuous Entropy Rate Estimator for Spike Trains Using a K-Means-Based Context Tree ⋮ Asymptotic property of universal lossless coding for independent piecewise identically distributed sources ⋮ The power of amnesia: Learning probabilistic automata with variable memory length ⋮ Unnamed Item ⋮ A Locally Optimal Algorithm for Estimating a Generating Partition from an Observed Time Series and Its Application to Anomaly Detection ⋮ Estimating Entropy Rates with Bayesian Confidence Intervals ⋮ On Martin-Löf Convergence of Solomonoff’s Mixture ⋮ Time-universal data compression ⋮ Joint Estimation of Intersecting Context Tree Models ⋮ Universal coding algorithm for a family of context Markov sources ⋮ A tree-weighting approach to sequential decision problems with multiplicative loss ⋮ Consistent estimation of the basic neighborhood of Markov random fields ⋮ Second step algorithms in the Burrows-Wheeler compression algorithm ⋮ 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 ⋮ Predicting the synaptic information efficacy in cortical layer 5 pyramidal neurons using a minimal integrate-and-fire model ⋮ Estimating Information Rates with Confidence Intervals in Neural Spike Trains ⋮ Macroeconomic simulation comparison with a multivariate extension of the Markov information criterion ⋮ Estimation of General Stationary Processes by Variable Length Markov Chains ⋮ Perfect simulation of processes with long memory: A “coupling into and from the past” algorithm ⋮ Testing exchangeability: fork-convexity, supermartingales and e-processes ⋮ Distributions of pattern statistics in sparse Markov models ⋮ Context exhumation after the Burrows-Wheeler transform ⋮ Mixing strategies for density estimation. ⋮ The consistency of the BIC Markov order estimator. ⋮ Predicting nearly as well as the best pruning of a planar decision graph. ⋮ On Martin-Löf (non-)convergence of Solomonoff's universal mixture
This page was built for publication: The context-tree weighting method: basic properties
