Clustering with respect to the information distance

DOI10.1016/j.tcs.2022.06.039OpenAlexW3203981823MaRDI QIDQ2166746

Andrei Romashchenko

Publication date: 25 August 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2110.01346

zbMATH Keywords

Kolmogorov complexityclustersinformation distance

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

The Kolmogorov birthday paradox

Cites Work

• Unnamed Item
• Unnamed Item
• Stability of properties of Kolmogorov complexity under relativization
• Inequalities for Shannon entropy and Kolmogorov complexity
• Pairs of words with nonmaterializable mutual information
• A criterion for extractability of mutual information for a triple of strings
• A new class of non-Shannon-type inequalities for entropies
• Clustering by Compression
• The Similarity Metric
• Information distance
• On characterization of entropy function via information inequalities
• Logical basis for information theory and probability theory
• THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
• An introduction to Kolmogorov complexity and its applications

This page was built for publication: Clustering with respect to the information distance