Clustering with Respect to the Information Distance

DOI10.1016/J.TCS.2022.06.039MaRDI QIDQ6379308arXivFDO

Authors Andrei Romashchenko

Publication date 4 October 2021

Published in arXiv

Full work available at URL https://doi.org/10.1016/J.TCS.2022.06.039

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

arXiv classification

cs.DM cs.IT math.IT

Abstract: We discuss the notion of a dense cluster with respect to the information distance and prove that all such clusters have an extractable core that represents the mutual information shared by the objects in the cluster.

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 Q6379308)