Symbol Compression Ratio for String Compression and Estimation of Kolmogorov Complexity
نویسنده
چکیده
A new compression algorithm is derived that computes and encodes the Minimum Message Length (MML) near optimal partition of symbols in a string for compression. Using Symbol Compression Ratio (SCR) as a driving function this algorithm produces a binary tree model of the data that introduces a fundamental parameter of information related to Kolmogorov Complexity – the size of the alphabet in the near optimal partition.
منابع مشابه
Compression Complexity
The Kolmogorov complexity of x, denoted C(x), is the length of the shortest program that generates x. For such a simple definition, Kolmogorov complexity has a rich and deep theory, as well as applications to a wide variety of topics including learning theory, complexity lower bounds and SAT algorithms. Kolmogorov complexity typically focuses on decompression, going from the compressed program ...
متن کاملTitle Kolmogorov Complexity Estimation and Analysis
Methods for discerning and measuring Kolmogorov Complexity are discussed and their relationships explored. A computationally efficient method of using Lempel Ziv 78 Universal compression algorithm to estimate complexity is introduced. 1 Abstract—Methods for discerning and measuring Kolmogorov Complexity are discussed and their relationships explored. A computationally efficient method of using ...
متن کاملExtended-Alphabet Finite-Context Models
The Normalized Relative Compression (NRC) is a recent dissimilarity measure, related to the Kolmogorov Complexity. It has been successfully used in different applications, like DNA sequences, images or even ECG (electrocardiographic) signal. It uses a compressor that compresses a target string using exclusively the information contained in a reference string. One possible approach is to use fin...
متن کاملCalculating Kolmogorov Complexity from the Output Frequency Distributions of Small Turing Machines
Drawing on various notions from theoretical computer science, we present a novel numerical approach, motivated by the notion of algorithmic probability, to the problem of approximating the Kolmogorov-Chaitin complexity of short strings. The method is an alternative to the traditional lossless compression algorithms, which it may complement, the two being serviceable for different string lengths...
متن کاملGuessing and compression subject to distortion
The problem of guessing a random string is revisited. The relationship between guessing without distortion and compression is extended to the case when source alphabet size is countably infinite. Further, similar relationship is established for the case when distortion allowed by establishing a tight relationship between rate distortion codes and guessing strategies.
متن کامل