Skip to main content
SpringerLink
Log in

Polynomial-time approximation scheme for a problem of partitioning a finite set into two clusters

  • Published:
Proceedings of the Steklov Institute of Mathematics Aims and scope Submit manuscript

Abstract

We consider the strongly NP-hard problem of partitioning a finite set of points of Euclidean space into two clusters of given cardinalities under the minimum criterion for the sum over the clusters of the intracluster sums of squared distances from elements of the cluster to its center. It is assumed that the center of one of the clusters is given (without loss of generality, at the origin). The center of the second cluster is unknown and is defined as the mean value over all elements in this cluster. A polynomial-time approximation scheme (PTAS) is provided.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. D. Aloise, A. Deshpande, P. Hansen, and P. Popat, “NP-hardness of Euclidean sum-of-squares clustering,” Machine Learning 75 (2), 245–248 (2009).

    Article  Google Scholar 

  2. A. K. Jain, “Data clustering: 50 years beyond k-means,” Pattern Recogn. Lett. 31, 651–666 (2010).

    Article  Google Scholar 

  3. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Fransisco, 1979).

    MATH  Google Scholar 

  4. E. Kh. Gimadi, A. V. Kel’manov, M. A. Kel’manova, and S. A. Khamidullin, “A posteriori detecting a quasiperiodic fragment in a numerical sequence,” Pattern Recogn. Image Anal. 18 (1), 30–42 (2008).

    Article  MATH  Google Scholar 

  5. A. Kel’manov and V. Khandeev, “”An exact pseudopolynomial algorithm for a problem of the two-cluster partitioning of a set of vectors,” J. Appl. Ind. Math. 9 (4), 497–502 (2015).

    Article  MATH  Google Scholar 

  6. N. Wirth, Algorithms + Data Structures = Programs (Prentice Hall, Englewood Cliffs, NJ, 1976).

    MATH  Google Scholar 

  7. A. E. Baburin, E. Kh. Gimadi, N. I. Glebov, and A. V. Pyatkin, “The problem of finding a subset of vectors with the maximum total weight,” J. Appl. Ind. Math. 2 (1), 32–38 (2008).

    Article  MathSciNet  MATH  Google Scholar 

  8. E. Kh. Gimadi, Yu. V. Glazkov, and I. A. Rykov, “On two problems of choosing some subset of vectors with integer coordinates that has maximum norm of the sum of elements in Euclidean space,” J. Appl. Ind. Math. 3 (3), 343–352 (2009).

    Article  MATH  Google Scholar 

  9. E. Kh. Gimadi, A. V. Kel’manov, M. A. Kel’manova, and S. A. Khamidullin, “A posteriori detection of a quasiperiodic fragment with a given number of repetitions in a numerical sequence,” Sib. Zh. Ind. Mat. 9 (1), 55–74 (2006).

    MathSciNet  MATH  Google Scholar 

  10. E. Kh. Gimadi, A. V. Pyatkin, and I. A. Rykov, “On polynomial solvability of some problems of a vector subset choice in a Euclidean space of fixed dimension,” J. Appl. Ind. Math. 4 (1), 48–53 (2010).

    Article  MATH  Google Scholar 

  11. A. V. Dolgushev and A. V. Kel’manov, “An approximation algorithm for solving a problem of cluster analysis,” J. Appl. Ind. Math. 5 (4), 551–558 (2011).

    Article  MathSciNet  MATH  Google Scholar 

  12. A. V. Kel’manov, “On the complexity of some data analysis problems,” Comp. Math. Math. Phys. 50 (11), 1941–1947 (2010).

    Article  MathSciNet  MATH  Google Scholar 

  13. A. V. Kel’manov, “On the complexity of some cluster analysis problems,” Comp. Math. Math. Phys. 51 (11), 1983–1988 (2011).

    Article  Google Scholar 

  14. A. V. Kel’manov and A. V. Pyatkin, “On the complexity of a search for a subset of “similar” vectors,” Dokl. Math. 78 (1), 574–575 (2008).

    Article  MATH  Google Scholar 

  15. A. V. Kel’manov and A. V. Pyatkin, “On a version of the problem of choosing a vector subset,” J. Appl. Ind. Math. 3 (4), 447–455 (2009).

    Article  Google Scholar 

  16. A. V. Kel’manov and A. V. Pyatkin, “Complexity of certain problems of searching for subsets of vectors and cluster analysis,” Comp. Math. Math. Phys. 49 (11), 1966–1971 (2009).

    Article  MATH  Google Scholar 

  17. A. V. Kel’manov and V. I. Khandeev, “Fully polynomial-time approximation scheme for a special case of a quadratic Euclidean 2-clustering problem,” Comp. Math. Math. Phys. 56 (2), 334–341 (2016).

    Article  MathSciNet  MATH  Google Scholar 

  18. A. V. Kel’manov and V. I. Khandeev, “A randomized algorithm for two-cluster partition of a set of vectors,” Comp. Math. Math. Phys. 55 (2), 330–339 (2015).

    Article  MathSciNet  MATH  Google Scholar 

  19. V. V. Shenmaier, “An approximation scheme for a problem of search for a vector subset,” J. Appl. Ind. Math. 6 (3), 381–386 (2012).

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Novosibirsk State University, Novosibirsk, 630090, Russia

    A. V. Dolgushev & A. V. Kel’manov

  2. Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk, 630090, Russia

    A. V. Kel’manov & V. V. Shenmaier

Authors
  1. A. V. Dolgushev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. V. Kel’manov
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. V. V. Shenmaier
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. V. Dolgushev.

Additional information

Original Russian Text © A.V. Dolgushev, A.V. Kel’manov, V.V. Shenmaier, 2015, published in Trudy Instituta Matematiki i Mekhaniki UrO RAN, 2015, Vol. 21, No. 3.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Dolgushev, A.V., Kel’manov, A.V. & Shenmaier, V.V. Polynomial-time approximation scheme for a problem of partitioning a finite set into two clusters. Proc. Steklov Inst. Math. 295 (Suppl 1), 47–56 (2016). https://doi.org/10.1134/S0081543816090066

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0081543816090066

Keywords

Search

Navigation