An approximation polynomial-time algorithm for a sequence bi-clustering problem

We consider a strongly NP-hard problem of partitioning a finite sequence of vectors in Euclidean space into two clusters using the criterion of the minimal sum of the squared distances from the elements of the clusters to the centers of the clusters. The center of one of the clusters is to be optimi...

Full description

Saved in:

Bibliographic Details
Published in:	Computational mathematics and mathematical physics Vol. 55; no. 6; pp. 1068 - 1076
Main Authors:	Kel’manov, A. V., Khamidullin, S. A.
Format:	Journal Article
Language:	English
Published:	Moscow Pleiades Publishing 01.06.2015 Springer Nature B.V
Subjects:	Algorithms Approximation Clustering Clusters Computational mathematics Computational Mathematics and Numerical Analysis Euclidean geometry Euclidean space Mathematical analysis Mathematical models Mathematics Mathematics and Statistics Optimization Polynomials Sequences Studies Vectors (mathematics) NP-hardness approximation polynomial-time algorithm clustering minimum of the sum of squared distances sequence of Euclidean vectors
ISSN:	0965-5425, 1555-6662
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!