A randomized algorithm for two-cluster partition of a set of vectors

作者：Kel'manov A V^*; Khandeev V I

来源：Computational Mathematics and Mathematical Physics, 2015, 55(2): 330-339.

DOI：10.1134/S096554251502013X

• partition
• set of vectors
• squared Euclidean distances
• NP-hardness
• randomized algorithm
• asymptotic accuracy

A randomized algorithm is substantiated for the strongly NP-hard problem of partitioning a finite set of vectors of Euclidean space into two clusters of given sizes according to the minimum-of-the sum-of-squared-distances criterion. It is assumed that the centroid of one of the clusters is to be optimized and is determined as the mean value over all vectors in this cluster. The centroid of the other cluster is fixed at the origin. For an established parameter value, the algorithm finds an approximate solution of the problem in time that is linear in the space dimension and the input size of the problem for given values of the relative error and failure probability. The conditions are established under which the algorithm is asymptotically exact and runs in time that is linear in the space dimension and quadratic in the input size of the problem.

• 出版日期2015-2