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, 2010, Volume 17, Issue 2, Pages 39–45 (Mi da604)  
This article is cited in 12 scientific papers (total in 12 papers)

On the issue of algorithmic complexity of one cluster analysis problem

A. V. Dolgusheva, A. V. Kel'manovba

a Novosibirsk State University, Novosibirsk, Russia
b S. L. Sobolev Institute of Mathematics, SB RAS, Novosibirsk, Russia
Full-text PDF (230 kB) Citations (12)
References:
PDF
HTML
Abstract: In the paper the problem of minimum sum-of-squares clustering (MSSC) of a set of euclidian vectors is proved to be NP-complete when the dimension of the space is a part and the number of clusters is not a part of the input. Bibl. 9.
Keywords: clustering, MSSC, algorithmic complexity, NP-completeness.
Received: 01.12.2009
Revised: 17.12.2009
Bibliographic databases:
Document Type: Article
UDC: 519.2+621.391
Language: Russian
Citation: A. V. Dolgushev, A. V. Kel'manov, “On the issue of algorithmic complexity of one cluster analysis problem”, Diskretn. Anal. Issled. Oper., 17:2 (2010), 39–45
Citation in format AMSBIB
\Bibitem{DolKel10}
\by A.~V.~Dolgushev, A.~V.~Kel'manov
\paper On the issue of algorithmic complexity of one cluster analysis problem
\jour Diskretn. Anal. Issled. Oper.
\yr 2010
\vol 17
\issue 2
\pages 39--45
\mathnet{http://mi.mathnet.ru/da604}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2682088}
\zmath{https://zbmath.org/?q=an:1248.62101}
Linking options:
  • https://www.mathnet.ru/eng/da604
  • https://www.mathnet.ru/eng/da/v17/i2/p39
    • This publication is cited in the following 12 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:639
    Full-text PDF :122
    References:60
    First page:2
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024