An Ensemble and Multi-View Clustering Method Based on Kolmogorov Complexity - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Entropy Année : 2023

An Ensemble and Multi-View Clustering Method Based on Kolmogorov Complexity

Résumé

The ability to build more robust clustering from many clustering models with different solutions is relevant in scenarios with privacy-preserving constraints, where data features have a different nature or where these features are not available in a single computation unit. Additionally, with the booming number of multi-view data, but also of clustering algorithms capable of producing a wide variety of representations for the same objects, merging clustering partitions to achieve a single clustering result has become a complex problem with numerous applications. To tackle this problem, we propose a clustering fusion algorithm that takes existing clustering partitions acquired from multiple vector space models, sources, or views, and merges them into a single partition. Our merging method relies on an information theory model based on Kolmogorov complexity that was originally proposed for unsupervised multi-view learning. Our proposed algorithm features a stable merging process and shows competitive results over several real and artificial datasets in comparison with other state-of-the-art methods that have similar goals.
Fichier principal
Vignette du fichier
entropy-25-00371.pdf (379.77 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Licence : CC BY - Paternité

Dates et versions

hal-03993735 , version 1 (17-02-2023)

Licence

Paternité

Identifiants

Citer

Juan Zamora, Jérémie Sublime. An Ensemble and Multi-View Clustering Method Based on Kolmogorov Complexity. Entropy, 2023, Special Issue Pattern Recognition and Data Clustering in Information Theory, 25(2) (371), ⟨10.3390/e25020371⟩. ⟨hal-03993735⟩

Collections

ISEP
10 Consultations
12 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More