A linear-time algorithm for computing the multinomial stochastic complexity
From MaRDI portal
Publication:2379977
DOI10.1016/J.IPL.2007.04.003zbMATH Open1184.68266OpenAlexW1980971799MaRDI QIDQ2379977FDOQ2379977
Authors: Petri Kontkanen, Petri Myllymäki 
Publication date: 24 March 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2007.04.003
Recommendations
- The Probabilistic Theory of Linear Complexity
- scientific article; zbMATH DE number 7204268
- The Probabilistic Theory of the Joint Linear Complexity of Multisequences
- On stochastic complexity estimation: a decision-theoretic approach
- Probabilistic complexity analysis for linear problems in bounded domains
- On polynomial complexity of a stochastic algorithm for mixed zero-one programs.
- scientific article; zbMATH DE number 3870594
- Improved results on the probabilistic theory of the joint linear complexity of multisequences
- scientific article; zbMATH DE number 2019635
- A combinatorial approach to probabilistic results on the linear- complexity profile of random sequences
Cites Work
- Estimating the dimension of a model
- Title not available (Why is that?)
- On the Lambert \(w\) function
- Title not available (Why is that?)
- Modeling by shortest data description
- Title not available (Why is that?)
- Special issue: Average-case analysis of algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Asymptotic minimax regret for data compression, gambling, and prediction
- The minimum description length principle in coding and modeling
- Fisher information and stochastic complexity
- A Recurrence Related to Trees
- Title not available (Why is that?)
- Strong optimality of the normalized ML models as universal codes and information in data
Cited In (12)
- Hierarchical two-part MDL code for multinomial distributions
- Title not available (Why is that?)
- The decomposed normalized maximum likelihood code-length criterion for selecting hierarchical latent variable models
- Graph Summarization with Latent Variable Probabilistic Models
- Clustgrams: an extension to histogram densities based on the minimum description length principle
- On model selection, Bayesian networks, and the Fisher information integral
- Using the Bayesian Shtarkov solution for predictions
- Minimum description length revisited
- The Complexity of Strict Minimum Message Length Inference
- Fast and fully-automated histograms for large-scale data sets
- Title not available (Why is that?)
- Unsupervised discretization by two-dimensional MDL-based histogram
This page was built for publication: A linear-time algorithm for computing the multinomial stochastic complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2379977)
