Repeatedly extracting shortest features decomposes a string's information into near-independent parts whose total length is within logarithmic error of its Kolmogorov complexity.
A new look at the statistical model identification.Automatica, 19(6):465–471, 1978
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
A theory of incremental compression
Repeatedly extracting shortest features decomposes a string's information into near-independent parts whose total length is within logarithmic error of its Kolmogorov complexity.