Zh. Vychisl. Mat. Mat. Fiz., 2009 Volume 49, Number 11, Pages 2059–2065
(Mi zvmmf4789)
This article is cited in
31 papers
Complexity of certain problems of searching for subsets of vectors and cluster analysis A. V. Kel'manov ,
A. V. Pyatkin Sobolev Institute of Mathematics, Siberian Branch, Russian Academy of Sciences, pr. Akademika Koptyuga 4, Novosibirsk, 630090, Russia Abstract:
The discrete extremal problems to which certain problems of searching for subsets of vectors and cluster analysis are reduced are proved to be NP-complete.
Key words:
discrete extremal problem, complexity, NP-completeness, search for subsets, cluster analysis, pattern recognition.
UDC:
519.71 Received: 21.10.2008
© , 2025
Fulltext:
PDF file (872 kB)