Fundamentalnaya i Prikladnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Journal history

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Fundam. Prikl. Mat.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Fundamentalnaya i Prikladnaya Matematika, 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
References:
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.
Funding agency Grant number
Moscow Center of Fundamental and Applied Mathematics
The research of the second and third authors was partially supported by the Moscow Center of Fundamental and Applied Mathematics, grant “Structure theory and combinatorial-logical methods in the theory of algebraic systems.”
English version:
Journal of Mathematical Sciences (New York), 2022, Volume 262, Issue 5, Pages 603–616
DOI: https://doi.org/10.1007/s10958-022-05841-9
Document Type: Article
UDC: 004.021
Language: Russian
Citation: R. R. Aidagulov, S. T. Glavatsky, A. V. Mikhalev, “Clustering models”, Fundam. Prikl. Mat., 23:2 (2020), 17–36; J. Math. Sci., 262:5 (2022), 603–616
Citation in format AMSBIB
\Bibitem{AidGlaMik20}
\by R.~R.~Aidagulov, S.~T.~Glavatsky, A.~V.~Mikhalev
\paper Clustering models
\jour Fundam. Prikl. Mat.
\yr 2020
\vol 23
\issue 2
\pages 17--36
\mathnet{http://mi.mathnet.ru/fpm1881}
\transl
\jour J. Math. Sci.
\yr 2022
\vol 262
\issue 5
\pages 603--616
\crossref{https://doi.org/10.1007/s10958-022-05841-9}
Linking options:
  • https://www.mathnet.ru/eng/fpm1881
  • https://www.mathnet.ru/eng/fpm/v23/i2/p17
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Фундаментальная и прикладная математика
    Statistics & downloads:
    Abstract page:204
    Full-text PDF :274
    References:29
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024