Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Zh. Vychisl. Mat. Mat. Fiz.:
Year:
Volume:
Issue:
Page:
Find




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

Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki, 2008, Volume 48, Number 1, Pages 176–192 (Mi zvmmf203)  
This article is cited in 6 scientific papers (total in 6 papers)

Solving clusterization problems using groups of algorithms

A. S. Biryukov, V. V. Ryazanov, A. S. Shmakov

Dorodnicyn Computing Center, Russian Academy of Sciences, ul. Vavilova 40, Moscow, 119991, Russia
Full-text PDF (2058 kB) Citations (6)
References:
PDF
HTML
Abstract: Clusterization is one of the most widespread problems in data analysis. There are many approaches and methods for its solution. However, the result of clusterization strongly depends on the choice of the feature space, on the object proximity measures, and on the method used to formalize the concepts of the object and cluster equivalence. As a result, different solutions can be far apart from each other; they can be degenerate or be quite different from the actually existing groupings. In this paper, clusterization obtained by groups of algorithms is considered; these methods make it possible to construct consistent solutions that best match the actually existing groupings.
Key words: clusterization, ensemble clusterization, cluster analysis, committee synthesis, hypergraph.
Received: 06.06.2007
English version:
Computational Mathematics and Mathematical Physics, 2008, Volume 48, Issue 1, Pages 168–183
DOI: https://doi.org/10.1007/s11470-008-1013-7
Bibliographic databases:
Document Type: Article
UDC: 519.6:519.7
Language: Russian
Citation: A. S. Biryukov, V. V. Ryazanov, A. S. Shmakov, “Solving clusterization problems using groups of algorithms”, Zh. Vychisl. Mat. Mat. Fiz., 48:1 (2008), 176–192; Comput. Math. Math. Phys., 48:1 (2008), 168–183
Citation in format AMSBIB
\Bibitem{BirRyaShm08}
\by A.~S.~Biryukov, V.~V.~Ryazanov, A.~S.~Shmakov
\paper Solving clusterization problems using groups of algorithms
\jour Zh. Vychisl. Mat. Mat. Fiz.
\yr 2008
\vol 48
\issue 1
\pages 176--192
\mathnet{http://mi.mathnet.ru/zvmmf203}
\mathscinet{https://mathscinet.ams.org/mathscinet-getitem?mr=2426450}
\zmath{https://zbmath.org/?q=an:05282413}
\transl
\jour Comput. Math. Math. Phys.
\yr 2008
\vol 48
\issue 1
\pages 168--183
\crossref{https://doi.org/10.1007/s11470-008-1013-7}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000262227600013}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-43249115186}
Linking options:
  • https://www.mathnet.ru/eng/zvmmf203
  • https://www.mathnet.ru/eng/zvmmf/v48/i1/p176
    • This publication is cited in the following 6 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Журнал вычислительной математики и математической физики Computational Mathematics and Mathematical Physics
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025