An Introduction to Coding Theory and the Two-Part Minimum Description Length Principle
From MaRDI portal
Cites work
- A Minimum Description Length-Based Image Segmentation Procedure, and Its Comparison with a Cross-Validation-Based Segmentation Procedure
- A new look at the statistical model identification
- Coding decision trees
- Density estimation by stochastic complexity
- Fisher information and stochastic complexity
- scientific article; zbMATH DE number 991833 (Why is no real title available?)
- scientific article; zbMATH DE number 107482 (Why is no real title available?)
- Inferring decision trees using the minimum description length principle
- Mixture Densities, Maximum Likelihood and the EM Algorithm
- Model Selection and the Principle of Minimum Description Length
- Model selection based on minimum description length
- Model selection using wavelet decomposition and applications
- On stochastic complexity and nonparametric density estimation
- Regression spline smoothing using the minimum description length principle
- Some Comments on C P
- Stochastic complexity in learning
- Universal codeword sets and representations of the integers
Cited in
(8)- Fusion learning for inter-laboratory comparisons
- Generalized threshold latent variable model
- Break detection for a class of nonlinear time series models
- Segmented model selection in quantile regression using the minimum description length principle
- Structural changes estimation for strongly dependent processes
- A Composite Likelihood-Based Approach for Change-Point Detection in Spatio-Temporal Processes
- Generalized multivariate threshold autoregressive models with linearly partitioned threshold space
- An MDL approach to the climate segmentation problem
This page was built for publication: An Introduction to Coding Theory and the Two-Part Minimum Description Length Principle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4831995)
