Pages that link to "Item:Q2379977"
From MaRDI portal
The following pages link to A linear-time algorithm for computing the multinomial stochastic complexity (Q2379977):
Displayed 9 items.
- Clustgrams: an extension to histogram densities based on the minimum description length principle (Q692998) (← links)
- Using the Bayesian Shtarkov solution for predictions (Q1658740) (← links)
- On model selection, Bayesian networks, and the Fisher information integral (Q1670496) (← links)
- Hierarchical two-part MDL code for multinomial distributions (Q1726276) (← links)
- The decomposed normalized maximum likelihood code-length criterion for selecting hierarchical latent variable models (Q2218353) (← links)
- Minimum description length revisited (Q4997077) (← links)
- Graph Summarization with Latent Variable Probabilistic Models (Q5050353) (← links)
- Unsupervised discretization by two-dimensional MDL-based histogram (Q6134323) (← links)
- Fast and fully-automated histograms for large-scale data sets (Q6167056) (← links)