Clustering with Respect to the Information Distance
Andrei Romashchenko

TL;DR
This paper explores the concept of dense clusters based on information distance, demonstrating that such clusters contain a core that encapsulates the shared mutual information among the objects.
Contribution
It introduces the notion of dense clusters with respect to information distance and proves the existence of an extractable core representing shared mutual information.
Findings
Dense clusters have an extractable core of shared mutual information.
The core effectively captures the mutual information among objects in a cluster.
Theoretical proof of the existence of such cores in dense clusters.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Algebra and Logic · Rough Sets and Fuzzy Logic · Computability, Logic, AI Algorithms
