A fast consistent grid-based clustering algorithm

A fast consistent grid-based clustering algorithm Full article

Journal

Pattern Analysis and Applications
ISSN: 1433-7541

Output data

Year: 2024, Volume: 27, Number: 4, Pages: 1-11 Pages count : 11 DOI: 10.1007/s10044-024-01354-0

Tags

Clustering · Estimator for the number of clusters · Density level sets · Big data

Authors

Tarasenko Anton S. ^1,2 , Berikov Vladimir B. ^1,2 , Pestunov Igor A. ³ , Rylov Sergey A. ³ , Ruzankin Pavel S. ^1,2

Affiliations

1	Sobolev Institute of Mathematics, Novosibirsk, Russia
2	Novosibirsk State University, Novosibirsk, Russia
3	Federal Research Center for Information and Computational Technologies, Novosibirsk, Russia

Funding (3)

1	Sobolev Institute of Mathematics	FWNF-2022-0010
2	Sobolev Institute of Mathematics	FWNF-2022-0015
3	Sobolev Institute of Mathematics	FWNF-2024-0001

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.

Tarasenko A.S. , Berikov V.B. , Pestunov I.A. , Rylov S.A. , Ruzankin P.S.
A fast consistent grid-based clustering algorithm
Pattern Analysis and Applications. 2024. V.27. N4. P.1-11. DOI: 10.1007/s10044-024-01354-0 WOS Scopus РИНЦ OpenAlex

Submitted:	Aug 5, 2023
Accepted:	Oct 3, 2024
Published print:	Nov 6, 2024
Published online:	Nov 6, 2024

Web of science:	WOS:001349687400005
Scopus:	2-s2.0-85208745855
Elibrary:	78810013
OpenAlex:	W4404119837

Пока нет цитирований