NP-completeness of some problems of choosing a vector subset
- 1 July 2011
- journal article
- Published by Pleiades Publishing Ltd in Journal of Applied and Industrial Mathematics
- Vol. 5 (3), 352-357
- https://doi.org/10.1134/s1990478911030069
Abstract
The NP-completeness is proved of some problems of choosing a Euclidean vector subset. One of the data analysis problems is reduced to these problems. The required subset is assumed to have a fixed cardinality and include the vectors that are “close” to each other by the criterium of the minimum sum of squares of distances.Keywords
This publication has 2 references indexed in Scilit:
- The Planar k-Means Problem is NP-HardLecture Notes in Computer Science, 2009
- A Method for Cluster AnalysisBiometrics, 1965