Skip to search formSkip to main contentSkip to account menu

Kolmogorov structure function

In 1973 Kolmogorov proposed a non-probabilistic approach to statistics and model selection. Let each data be a finite binary string and models be… 
Wikipedia (opens in a new tab)

Related topics

Related topics

5 relations

Broader (1)

Algorithmic information theory
Kolmogorov complexityMathematical modelMinimum description lengthString (computer science)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Magic Points in Finance: Empirical Integration for Parametric Option Pricing
We propose an offline-online procedure for Fourier transform based option pricing. The method supports the acceleration of such… 
2015
2015
Kolmogorov structure functions for automatic complexity
2014
2014
Kolmogorov Structure Functions for Automatic Complexity in Computational Statistics
  • B. Kjos-Hanssen
  • International Conference on Combinatorial…
  • 2014
  • Corpus ID: 10995146
For a finite word \(w\) of length \(n\) and a class of finite automata \(\mathcal A\), we study the Kolmogorov structure function… 
2011
2011
Satellite image artifacts detection based on complexity distortion theory
The artifacts detection is a step of data cleaning process. The classical approach is to predict or determine the existence of… 
2010
2010
On the use of Kolmogorov structure function for periodogram smoothing
In a recent series of papers, it was shown how the periodogram can be smoothed by thresholding the estimated cepstral… 
2008
2008
Algorithmic information theory
2007
2007
Sophistication Revisited
Abstract Kolmogorov complexity measures the amount of information in a string as the size of the shortest program that computes… 
2005
2005
Approximation of Sobolev-Type Classes with Quasi-Seminorms
. Since the Sobolev set W rp , 0 < p < 1, in general is not contained in L q , 0 < q ≤ ∞ , we limit ourselves to the set W rp ∩ L… 
2005
2005
Image denoising based on Kolmogorov structure function for a class of hierarchical image models
Kolmogorov's structure function (KSF) is used in the algorithmic theory of complexity for describing the structure of a string by… 
Highly Cited
2000
Highly Cited
2000
Algorithmic statistics
While Kolmogorov (1965, 1983) complexity is the accepted absolute measure of information content of an individual finite object… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)