Pages that link to "Item:Q3547751"
From MaRDI portal
The following pages link to Kolmogorov's Structure Functions and Model Selection (Q3547751):
Displaying 24 items.
- Algorithmic minimal sufficient statistics: a new approach (Q285518) (← links)
- Effective complexity of stationary process realizations (Q400883) (← links)
- Sophistication vs logical depth (Q519900) (← links)
- Between order and chaos: The quest for meaningful information (Q733743) (← links)
- Unsupervised interaction-preserving discretization of multivariate data (Q736501) (← links)
- Kolmogorov structure functions for automatic complexity (Q896123) (← links)
- Summarizing categorical data by clustering attributes (Q1944973) (← links)
- An extended coding theorem with application to quantum complexities (Q2216136) (← links)
- Some properties of antistochastic strings (Q2411042) (← links)
- Predictive information in a nonequilibrium critical model (Q2440339) (← links)
- Occam bound on lowest complexity of elements (Q2630827) (← links)
- Individual communication complexity (Q2643018) (← links)
- Algorithmic Statistics Revisited (Q2805729) (← links)
- Two Problems for Sophistication (Q2835644) (← links)
- Kolmogorov Structure Functions for Automatic Complexity in Computational Statistics (Q2942440) (← links)
- Similarity and denoising (Q2955479) (← links)
- Algorithmic Statistics: Forty Years Later (Q2970987) (← links)
- Kolmogorov Complexity and Model Selection (Q3392938) (← links)
- Algorithmic Minimal Sufficient Statistic Revisited (Q3576086) (← links)
- Algorithmic Statistics: Normal Objects and Universal Models (Q5740192) (← links)
- Few Paths, Fewer Words: Model Selection With Automatic Structure Functions (Q5743090) (← links)
- On algorithmic statistics for space-bounded algorithms (Q5919540) (← links)
- The Kolmogorov birthday paradox (Q6104350) (← links)
- Kolmogorov's Last Discovery? (Kolmogorov and Algorithmic Statistics) (Q6153527) (← links)
