Information Distance in Multiples

Authors:
P. M.B. Vitányi
Affiliations:
Nat. Res. Center for Math. & Comput. Sci. in the Netherlands, Netherlands
Venue:
IEEE Transactions on Information Theory
Year:
2011

Citing 0
Cited 3

Information distance and its extensions

DS'11 Proceedings of the 14th international conference on Discovery science
Randomness, computation and mathematics

CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Exploring programmable self-assembly in non-DNA based molecular computing

Natural Computing: an international journal

Quantified Score

Hi-index	754.84

Visualization

Abstract

Information distance is a parameter-free similarity measure based on compression, used in pattern recognition, data mining, phylogeny, clustering and classification. The notion of information distance is extended from pairs to multiples (finite lists). We study maximal overlap, metricity, universality, minimal overlap, additivity and normalized information distance in multiples. We use 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.