Clustering with Respect to the Information Distance

Andrei Romashchenko

doi:10.1016/j.tcs.2022.06.039

Journal Articles Theoretical Computer Science Year : 2022

Clustering with Respect to the Information Distance

(1)

Andrei Romashchenko

Function : Author
PersonId : 81
IdHAL : andrei-romashchenko
ORCID : 0000-0001-7723-7880
IdRef : 165481277

Systèmes complexes, automates et pavages

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.

Keywords

Kolmogorov Complexity Information distance clusters

Domains

Information Theory [math.IT] Discrete Mathematics [cs.DM] Computational Complexity [cs.CC]

Andrei Romashchenko : Connect in order to contact the contributor

https://hal-lirmm.ccsd.cnrs.fr/lirmm-03370967

Submitted on : Friday, October 8, 2021-12:08:59 PM

Last modification on : Friday, March 24, 2023-2:53:23 PM

Dates and versions

lirmm-03370967 , version 1 (08-10-2021)

Identifiers

HAL Id : lirmm-03370967 , version 1
ARXIV : 2110.01346
DOI : 10.1016/j.tcs.2022.06.039

Cite

Andrei Romashchenko. Clustering with Respect to the Information Distance. Theoretical Computer Science, 2022, 929, pp.164-171. ⟨10.1016/j.tcs.2022.06.039⟩. ⟨lirmm-03370967⟩

Export

BibTeX TEI Dublin Core DC Terms EndNote Datacite

Collections

CNRS INSMI ESCAPE LIRMM TDS-MACS UNIV-MONTPELLIER

60 View

0 Download

Clustering with Respect to the Information Distance

Abstract

Keywords

Domains

Dates and versions

Identifiers

Cite

Export

Collections

Altmetric

Share