Kolmogorov's Structure Functions and Model Selection
From MaRDI portal
Publication:3547751
Recommendations
Cited in
(25)- Summarizing categorical data by clustering attributes
- An extended coding theorem with application to quantum complexities
- Predictive information in a nonequilibrium critical model
- Occam bound on lowest complexity of elements
- Individual communication complexity
- Algorithmic statistics revisited
- Two Problems for Sophistication
- Algorithmic minimal sufficient statistics: a new approach
- Kolmogorov structure functions for automatic complexity in computational statistics
- Similarity and denoising
- Algorithmic statistics: forty years later
- Kolmogorov Complexity and Model Selection
- Algorithmic minimal sufficient statistic revisited
- Effective complexity of stationary process realizations
- Sophistication vs logical depth
- Algorithmic statistics: normal objects and universal models
- Few Paths, Fewer Words: Model Selection With Automatic Structure Functions
- The Kolmogorov birthday paradox
- Kolmogorov's Last Discovery? (Kolmogorov and Algorithmic Statistics)
- Grammar-based compression and its use in symbolic music analysis
- Kolmogorov complexity in the USSR (1975--1982): isolation and its end
- Loss-complexity landscape and model structure functions
- Between order and chaos: The quest for meaningful information
- Unsupervised interaction-preserving discretization of multivariate data
- Kolmogorov structure functions for automatic complexity
This page was built for publication: Kolmogorov's Structure Functions and Model Selection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547751)