Statistical Inference Through Data Compression |
Contents
Normalized Compression Distance NCD | 3 |
Technical Introduction | 11 |
6 | 25 |
Classification systems using | 71 |
Experiments with | 79 |
7 | 86 |
Automatic Meaning Discovery Using Google | 105 |
Stemmatology | 139 |
Common terms and phrases
102 Nobel prize admissible distance algorithm analysis approximate beatus Henricus binary bzip2 C(xy Chapter Cilibrasi classification code word CompLearn compressed version compression-based compressor consensus tree csoap data compression database defined digits distance matrix encode example experiments Figure finite Finland given Google distribution Google search gzip heuristic hierarchical clustering IEEE ILLC information distance input integer interior nodes Kolmogorov complexity labels language learning length manuscripts Metatheria mitochondrial genomes MQTC natural data NCD matrix neural networks objects optimal output P.M.B. Vitányi pairs parameters PHYLIP Phylogenetic phylogeny pieces possible prefix code prize winning writers probability mass function problem Prototheria quartet method quartet topologies quartet tree random reconstruction represents search terms Section segments semantic sequence similarity metric statistical stemma stemmatic stemmatology string subtree support vector machines theory thesis training data Turing machine universal Vadstena variants virus WordNet