Normalized Information Distance is Not Semicomputable

06/16/2010
by   Sebastiaan A. Terwijn, et al.
0

Normalized information distance (NID) uses the theoretical notion of Kolmogorov complexity, which for practical purposes is approximated by the length of the compressed version of the file involved, using a real-world compression program. This practical application is called 'normalized compression distance' and it is trivially computable. It is a parameter-free similarity measure based on compression, and is used in pattern recognition, data mining, phylogeny, clustering, and classification. The complexity properties of its theoretical precursor, the NID, have been open. We show that the NID is neither upper semicomputable nor lower semicomputable.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/20/2009

Information Distance in Multiples

Information distance is a parameter-free similarity measure based on com...
research
12/22/2012

Normalized Compression Distance of Multisets with Applications

Normalized compression distance (NCD) is a parameter-free, feature-free,...
research
10/21/2014

Generalized Compression Dictionary Distance as Universal Similarity Measure

We present a new similarity measure based on information theoretic measu...
research
02/20/2015

Web Similarity

Normalized web distance (NWD) is a similarity or normalized semantic dis...
research
05/22/2014

Compressive Mining: Fast and Optimal Data Mining in the Compressed Domain

Real-world data typically contain repeated and periodic patterns. This s...
research
02/16/2020

The normalized algorithmic information distance can not be approximated

It is known that the normalized algorithmic information distance N is no...
research
08/11/2017

Normalized Information Distance and the Oscillation Hierarchy

We study the complexity of approximations to the normalized information ...

Please sign up or login with your details

Forgot password? Click here to reset