Abstract:
A 2-approximation algorithm is presented for a data analysis problem which was previously reduced to an NP-hard optimization problem. Particularly, the problem is to partition a set of Euclidean vectors into two subsets (clusters) under the criterion of minimum-sum-of-squares. Bibliogr. 7.
Keywords:search for a vector subset, cluster analysis, NP-hardness, efficient approximate algorithm.