Login / Signup
Two-dimensional Kolmogorov complexity and an empirical validation of the Coding theorem method by compressibility.
Héctor Zenil
Fernando Soler-Toscano
Jean-Paul Delahaye
Nicolas Gauvrit
Published in:
PeerJ Comput. Sci. (2015)
Keyphrases
</>
segmentation method
pairwise
high dimensional
high accuracy
clustering method
kolmogorov complexity
three dimensional
computational complexity
preprocessing
lower bound
significant improvement
cost function
computational cost
semi supervised
detection method
high precision