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...

Full description

Saved in:
Bibliographic Details
Published inPattern analysis and applications : PAA Vol. 27; no. 4
Main Authors Tarasenko, Anton S., Berikov, Vladimir B., Pestunov, Igor A., Rylov, Sergey A., Ruzankin, Pavel S.
Format Journal Article
LanguageEnglish
Published London Springer London 01.12.2024
Springer Nature B.V
Subjects
Algorithms
Clustering
Computer Science
Pattern Recognition
Theoretical Advances
Big data
Density level sets
Clustering
Estimator for the number of clusters
Online AccessGet full text

Cover

More Information
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1433-7541
1433-755X
DOI:10.1007/s10044-024-01354-0