|
Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki, 2009, Volume 49, Number 11, Pages 2059–2065
(Mi zvmmf4789)
|
|
|
|
This article is cited in 31 scientific papers (total 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.
Received: 21.10.2008
Citation:
A. V. Kel'manov, A. V. Pyatkin, “Complexity of certain problems of searching for subsets of vectors and cluster analysis”, Zh. Vychisl. Mat. Mat. Fiz., 49:11 (2009), 2059–2065; Comput. Math. Math. Phys., 49:11 (2009), 1966–1971
Linking options:
https://www.mathnet.ru/eng/zvmmf4789 https://www.mathnet.ru/eng/zvmmf/v49/i11/p2059
|
Statistics & downloads: |
Abstract page: | 403 | Full-text PDF : | 120 | References: | 49 | First page: | 4 |
|