Normalized compression distance

Normalized compression distance (NCD) is a way of measuring the similarity between two objects, be it two documents, two letters, two emails, two music scores, two languages, two programs, two pictures, two systems, two genomes, to name a few. Such a measurement should not be application dependent or arbitrary. A reasonable definition for the similarity between two objects is how difficult it is to transform them into each other.

It can be used in information retrieval and data mining for cluster analysis.

Information distance

We assume that the objects one talks about are finite

between strings ${\displaystyle x}$ and ${\displaystyle y}$ as the length of the shortest program ${\displaystyle p}$ that computes ${\displaystyle x}$ from ${\displaystyle y}$ and vice versa. This shortest program is in a fixed programming language. For technical reasons one uses the theoretical notion of

Turing machines

. Moreover, to express the length of ${\displaystyle p}$ one uses the notion of Kolmogorov complexity. Then, it has been shown ^[1]

${\displaystyle |p|=\max\{K(x\mid y),K(y\mid x)\}}$

up to logarithmic additive terms which can be ignored. This information distance is shown to be a

(it satisfies the metric inequalities up to a logarithmic additive term), is universal (it minorizes every computable distance as computed for example from features up to a constant additive term).^[1]

Normalized information distance (similarity metric)

The information distance is absolute, but if we want to express similarity, then we are more interested in relative ones. For example, if two strings of length 1,000,000 differ by 1000 bits, then we consider that those strings are relatively more similar than two strings of 1000 bits that differ by 1000 bits. Hence we need to normalize to obtain a similarity metric. This way one obtains the normalized information distance (NID),

${\displaystyle NID(x,y)={\frac {\max\{K{(x\mid y)},K{(y\mid x)}\}}{\max\{K(x),K(y)\}}},}$

where ${\displaystyle K(x\mid y)}$ is

of ${\displaystyle x}$ given ${\displaystyle y}$ as input. The NID is called `the similarity metric.' since the function ${\displaystyle NID(x,y)}$ has been shown to satisfy the basic requirements for a metric distance measure.^[2][3] However, it is not computable or even semicomputable.^[4]

Normalized compression distance

While the NID metric is not computable, it has an abundance of applications. Simply approximating ${\displaystyle K}$ by real-world compressors, with ${\displaystyle Z(x)}$ is the binary length of the file ${\displaystyle x}$ compressed with compressor Z (for example "

rewrote the NID to obtain the Normalized Compression Distance (NCD)

${\displaystyle NCD_{Z}(x,y)={\frac {Z(xy)-\min\{Z(x),Z(y)\}}{\max\{Z(x),Z(y)\}}}.}$[3]

The NCD is actually a family of distances parametrized with the compressor Z. The better Z is, the closer the NCD approaches the NID, and the better the results are.^[3]

Applications

The normalized compression distance has been used to fully automatically reconstruct language and phylogenetic trees.^[2][3] It can also be used for new applications of general clustering and classification of natural data in arbitrary domains,^[3] for clustering of heterogeneous data,^[3] and for anomaly detection across domains.^[5] The NID and NCD have been applied to numerous subjects, including music classification,^[3] to analyze network traffic and cluster computer worms and viruses,^[6] authorship attribution,^[7] gene expression dynamics,^[8] predicting useful versus useless stem cells,^[9] critical networks,^[10] image registration,^[11] question-answer systems.^[12]

Performance

Researchers from the

One group have experimentally tested a closely related metric on a large variety of sequence benchmarks. Comparing their compression method with 51 major methods found in 7 major data-mining conferences over the past decade, they established superiority of the compression method for clustering heterogeneous data, and for anomaly detection, and competitiveness in clustering domain data.

NCD has an advantage of being robust to noise.^[13] However, although NCD appears "parameter-free", practical questions include which compressor to use in computing the NCD and other possible problems.^[14]

Comparison with the Normalized Relative Compression (NRC)

In order to measure the information of a string relative to another there is the need to rely on relative semi-distances (NRC).^[15] These are measures that do not need to respect symmetry and triangle inequality distance properties. Although the NCD and the NRC seem very similar, they address different questions. The NCD measures how similar both strings are, mostly using the information content, while the NRC indicates the fraction of a target string that cannot be constructed using information from another string. For a comparison, with application to the evolution of primate genomes, see.^[16]

Normalized Google distance

Objects can be given literally, like the literal four-letter

by Tolstoy. For simplicity we take it that all meaning of the object is represented by the literal object itself. Objects can also be given by name, like "the four-letter genome of a mouse," or "the text of `War and Peace' by Tolstoy." There are also objects that cannot be given literally, but only by name, and that acquire their meaning from their contexts in background common knowledge in humankind, like "home" or "red." We are interested in semantic similarity. Using code-word lengths obtained from the page-hit counts returned by Google from the web, we obtain a semantic distance using the NCD formula and viewing Google as a compressor useful for data mining, text comprehension, classification, and translation. The associated NCD, called the normalized Google distance (NGD) can be rewritten as

${\displaystyle NGD(x,y)={\frac {\max\{\log f(x),\log f(y)\}-\log f(x,y)}{\log N-\min\{\log f(x),\log f(y)\}}},}$

where ${\displaystyle f(x)}$ denotes the number of pages containing the search term ${\displaystyle x}$, and ${\displaystyle f(x,y)}$ denotes the number of pages containing both ${\displaystyle x}$ and ${\displaystyle y}$,) as returned by Google or any search engine capable of returning an aggregate page count. The number ${\displaystyle N}$ can be set to the number of pages indexed although it is more proper to count each page according to the number of search terms or phrases it contains. As rule of the thumb one can multiply the number of pages by, say, a thousand...^[17]

See also

• Word2vec

References

External links

• Efficient Estimation of Word Representations in Vector Space
• P. Vitanyi
  , An Introduction to Kolmogorov Complexity and Its Applications, Springer-Verlag, New York, 4th Edition 2019