A fast consistent grid-based clustering algorithm

A fast consistent grid-based clustering algorithm

We propose a fast consistent grid-based algorithm that estimates the number of clusters for observations in and, besides, constructs an approximation for the clusters. Consistency is proved under certain conditions. The time complexity of the algorithm can be made linear retaining the consistency. N...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Pattern analysis and applications : PAA 2024-12, Vol.27 (4), Article 139
Hauptverfasser: Tarasenko, Anton S., Berikov, Vladimir B., Pestunov, Igor A., Rylov, Sergey A., Ruzankin, Pavel S.
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Clustering
Computer Science
Pattern Recognition
Theoretical Advances
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We propose a fast consistent grid-based algorithm that estimates the number of clusters for observations in and, besides, constructs an approximation for the clusters. Consistency is proved under certain conditions. The time complexity of the algorithm can be made linear retaining the consistency. Numerical experiments confirm high computational efficiency of the new algorithm and its ability to process large datasets.
ISSN:1433-7541
1433-755X
DOI:10.1007/s10044-024-01354-0