A fast consistent grid-based clustering algorithm

We propose a fast consistent grid-based algorithm that estimates the number of clusters for observations in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\mathbb {R}}}^d$$\end{document} 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.