|
Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki, 2010, Volume 50, Number 11, Pages 2045–2051
(Mi zvmmf4971)
|
|
|
|
This article is cited in 10 scientific papers (total in 10 papers)
On the complexity of some data 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 discrete optimization problems is proved. These are the problems to which one can reduce some important problems arising in data analysis when certain subsets of vectors are sought.
Key words:
discrete optimization problem, complexity, NP-completeness, finding subsets of vectors in the Euclidean space, data analysis.
Received: 14.01.2010 Revised: 16.06.2010
Citation:
A. V. Kel'manov, “On the complexity of some data analysis problems”, Zh. Vychisl. Mat. Mat. Fiz., 50:11 (2010), 2045–2051; Comput. Math. Math. Phys., 50:11 (2010), 1941–1947
Linking options:
https://www.mathnet.ru/eng/zvmmf4971 https://www.mathnet.ru/eng/zvmmf/v50/i11/p2045
|
Statistics & downloads: |
Abstract page: | 313 | Full-text PDF : | 107 | References: | 60 | First page: | 11 |
|