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, 2013, Volume 20, Issue 4, Pages 36–45 (Mi da738)  
This article is cited in 21 scientific papers (total in 21 papers)

A $2$-approximation polynomial algorithm for one clustering problem

A. V. Kelmanovab, V. I. Khandeevb

a Sobolev Institute of Mathematics, 4 Acad. Koptyug Ave., 630090 Novosibirsk, Russia
b Novosibirsk State University, 2 Pirogov St., 630090 Novosibirsk, Russia
Full-text PDF (244 kB) Citations (21)
References:
PDF
HTML
Abstract: A $2$-approximation algorithm is presented for one NP-hard data analysis problem. Namely, the problem is to partition a set of Euclidean vectors into two subsets (clusters) under the criterion of minimum sum-of-squares of distances from the elements of clusters to their centers. The center of the first cluster is the average value of vectors in the cluster and the center of the second one is 0. Bibliogr. 16.
Keywords: cluster analysis, search for a vector subset, computational complexity, approximation polynomial algorithm.
Received: 12.06.2012
Revised: 21.10.2012
English version:
Journal of Applied and Industrial Mathematics, 2013, Volume 7, Issue 4, Pages 515–521
DOI: https://doi.org/10.1134/S1990478913040066
Bibliographic databases:
Document Type: Article
UDC: 519.2+621.391
Language: Russian
Citation: A. V. Kelmanov, V. I. Khandeev, “A $2$-approximation polynomial algorithm for one clustering problem”, Diskretn. Anal. Issled. Oper., 20:4 (2013), 36–45; J. Appl. Industr. Math., 7:4 (2013), 515–521
Citation in format AMSBIB
\Bibitem{KelKha13}
\by A.~V.~Kelmanov, V.~I.~Khandeev
\paper A $2$-approximation polynomial algorithm for one clustering problem
\jour Diskretn. Anal. Issled. Oper.
\yr 2013
\vol 20
\issue 4
\pages 36--45
\mathnet{http://mi.mathnet.ru/da738}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3114911}
\transl
\jour J. Appl. Industr. Math.
\yr 2013
\vol 7
\issue 4
\pages 515--521
\crossref{https://doi.org/10.1134/S1990478913040066}
Linking options:
  • https://www.mathnet.ru/eng/da738
  • https://www.mathnet.ru/eng/da/v20/i4/p36
    • This publication is cited in the following 21 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:374
    Full-text PDF :101
    References:66
    First page:3
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024