Sign Up to like & get
recommendations!
1
Published in 2018 at "Computational Mathematics and Mathematical Physics"
DOI: 10.1134/s0965542518120138
Abstract: We consider a strongly NP-hard problem of partitioning a finite Euclidean sequence into two clusters of given cardinalities minimizing the sum over both clusters of intracluster sums of squared distances from clusters elements to their…
read more here.
Keywords:
sequence clustering;
randomized algorithm;
algorithm sequence;
clustering problem ... See more keywords