RUS  ENG
Full version
JOURNALS // Fundamentalnaya i Prikladnaya Matematika // Archive

Fundam. Prikl. Mat., 2020 Volume 23, Issue 2, Pages 17–36 (Mi fpm1881)

Clustering models

R. R. Aidagulova, S. T. Glavatskyab, A. V. Mikhalevab

a Department of Theoretical Informatics, Faculty of Mechanics and Mathematics, Moscow Lomonosov State University, Leninskiye Gory 1, Moscow, 119991, Russia
b Moscow Center of Fundamental and Applied Mathematics, Moscow, 119991, Russia

Abstract: It is generally accepted that the term “clusterization” (bunch, bundle) was offered by the mathematician R. Trion. Subsequently, a number of terms emerged that are considered synonymous with the term “cluster analysis” or “automatic classification.” Cluster analysis has a very wide range of applications, its methods are used in medicine, chemistry, archeology, marketing, geology, and other disciplines. Clustering consists in grouping similar objects into groups, and this problem is one of the fundamental problems in the field of data analysis. Usually, clustering means the partitioning of a given set of points of a certain metric space into subsets in such a way that close points fall into one group, and distant ones fall into different groups. As will be shown below, this requirement is rather contradictory. Intuitive partitioning “by eye” uses the connectivity of the resulting groups, based on the density of distribution of points. In this paper, we offer a method of clusterization based on this idea.

UDC: 004.021


 English version:
Journal of Mathematical Sciences (New York), 2022, 262:5, 603–616


© Steklov Math. Inst. of RAS, 2024