Diskretnyi Analiz i Issledovanie Operatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find






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


Diskretnyi Analiz i Issledovanie Operatsii, 2011, Volume 18, Issue 2, Pages 29–40 (Mi da644)  

This article is cited in 29 scientific papers (total in 29 papers)

An approximation algorithm for one problem of cluster analysis

A. V. Dolgusheva, A. V. Kel'manovab

a Novosibirsk State University, Novosibirsk, Russia
b S. L. Sobolev Institute of Mathematics, SB RAS, Novosibirsk, Russia
References:
Abstract: A 2-approximation algorithm is presented for a data analysis problem which was previously reduced to an NP-hard optimization problem. Particularly, the problem is to partition a set of Euclidean vectors into two subsets (clusters) under the criterion of minimum-sum-of-squares. Bibliogr. 7.
Keywords: search for a vector subset, cluster analysis, NP-hardness, efficient approximate algorithm.
Received: 26.12.2010
Revised: 18.01.2011
English version:
Journal of Applied and Industrial Mathematics, 2011, Volume 5, Issue 4, Pages 551–558
DOI: https://doi.org/10.1134/S1990478911040107
Bibliographic databases:
Document Type: Article
UDC: 519.2+621.391
Language: Russian
Citation: A. V. Dolgushev, A. V. Kel'manov, “An approximation algorithm for one problem of cluster analysis”, Diskretn. Anal. Issled. Oper., 18:2 (2011), 29–40; J. Appl. Industr. Math., 5:4 (2011), 551–558
Citation in format AMSBIB
\Bibitem{DolKel11}
\by A.~V.~Dolgushev, A.~V.~Kel'manov
\paper An approximation algorithm for one problem of cluster analysis
\jour Diskretn. Anal. Issled. Oper.
\yr 2011
\vol 18
\issue 2
\pages 29--40
\mathnet{http://mi.mathnet.ru/da644}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2841699}
\zmath{https://zbmath.org/?q=an:1249.90186}
\transl
\jour J. Appl. Industr. Math.
\yr 2011
\vol 5
\issue 4
\pages 551--558
\crossref{https://doi.org/10.1134/S1990478911040107}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-82655170461}
Linking options:
  • https://www.mathnet.ru/eng/da644
  • https://www.mathnet.ru/eng/da/v18/i2/p29
  • This publication is cited in the following 29 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:490
    Full-text PDF :121
    References:53
    First page:6
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024