Centroid index: Cluster level similarity measure

In clustering algorithm, one of the main challenges is to solve the global allocation of the clusters instead of just local tuning of the partition borders. Despite this, all external cluster validity indexes calculate only point-level differences of two partitions without any direct information abo...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Pattern recognition 2014-09, Vol.47 (9), p.3034-3045
Hauptverfasser: Fränti, Pasi, Rezaei, Mohammad, Zhao, Qinpei
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In clustering algorithm, one of the main challenges is to solve the global allocation of the clusters instead of just local tuning of the partition borders. Despite this, all external cluster validity indexes calculate only point-level differences of two partitions without any direct information about how similar their cluster-level structures are. In this paper, we introduce a cluster level index called centroid index. The measure is intuitive, simple to implement, fast to compute and applicable in case of model mismatch as well. To a certain extent, we expect it to generalize other clustering models beyond the centroid-based k-means as well. [Display omitted] •Cluster level similarity measure.•The measure is intuitive, simple to implement and fast to compute.•Invariant to model mismatch.•Expected to generalize other clustering models beyond the centroid-based k-means.
ISSN:0031-3203
1873-5142
DOI:10.1016/j.patcog.2014.03.017