Zh. Vychisl. Mat. Mat. Fiz., 2011 Volume 51, Number 11, Pages 2106–2112
(Mi zvmmf9580)
|
This article is cited in
10 papers
On the complexity of some cluster analysis problems
A. V. Kel'manov Sobolev Institute of Mathematics, Siberian Branch, Russian Academy of Sciences, pr. akademika Koptyuga 4, Novosibirsk, 630090 Russia
Abstract:
NP-completeness of certain important clusterization problems for a finite set of vectors is proved.
Key words:
discrete optimization, complexity, NP-completeness, clusterization, Euclidean space, data analysis.
UDC:
519.712.41 Received: 15.02.2011
© , 2026
Fulltext:
PDF file (336 kB)