Clustering with respect to the information distance

DOI10.1016/J.TCS.2022.06.039MaRDI QIDQ2166746zbMATH OpenOpenAlexFDO

Authors 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

clustersinformation distanceKolmogorov complexity

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Information-based clustering
• A Robust Information Clustering Algorithm
• Clustering by Compression
• Information distance
• INFORMATION DISTANCE AND ITS APPLICATIONS

Cites work

• A criterion for extractability of mutual information for a triple of strings
• A new class of non-Shannon-type inequalities for entropies
• An introduction to Kolmogorov complexity and its applications
• Clustering by Compression
• scientific article; zbMATH DE number 3427210 (Why is no real title available?)
• scientific article; zbMATH DE number 3497786 (Why is no real title available?)
• Inequalities for Shannon entropy and Kolmogorov complexity
• Information distance
• Logical basis for information theory and probability theory
• On characterization of entropy function via information inequalities
• Pairs of words with nonmaterializable mutual information
• Stability of properties of Kolmogorov complexity under relativization
• THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
• The Similarity Metric

Cited in

(7)

• A k-Means-Like Algorithm for Clustering Categorical Data Using an Information Theoretic-Based Dissimilarity Measure
• scientific article; zbMATH DE number 5905610 (Why is no real title available?)
• scientific article; zbMATH DE number 5012235 (Why is no real title available?)
• Clustering with Partial Information
• Information-based clustering
• The Kolmogorov birthday paradox
• Clustering with Respect to the Information Distance

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2166746)