On the complexity of some data analysis problems

被引：7
|
作者：
Kel'manov, A. V. [1 ]
机构：
[1] Russian Acad Sci, Sobolev Inst Math, Siberian Branch, Novosibirsk 630090, Russia
来源：
COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS | 2010年 / 50卷 / 11期
基金：
俄罗斯基础研究基金会;
关键词：
discrete optimization problem; complexity; NP-completeness; finding subsets of vectors in the Euclidean space; data analysis; SUBSET;
D O I：
10.1134/S0965542510110163
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
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.
引用
收藏
页码：1941 / 1947
页数：7
相关论文
共 50 条
12345