Skip to main content
SpringerLink
Log in

An approximation algorithm for solving a problem of cluster analysis

  • Published:
Journal of Applied and Industrial Mathematics Aims and scope Submit manuscript

Abstract

The authors provide some 2-approximation algorithm for an intractable problem to which one can reduce the problem of partitioning a vector set in Euclidean space into the two subsets (clusters) having the minimum sum of distance squares.

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. 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,” Diskret. Anal. Issled. Oper. Ser. 2, 14(1), 22–32 (2007) [J. Appl. Indust. Math. 2 (1), 32–38 (2008)].

    MathSciNet  Google Scholar 

  2. E. Kh. Gimadi, Yu. V. Glazkov, and I. A. Rykov, “On Two Problems of Choosing Some Subset of Vectors with Integer Coordinates That Has the Maximum Norm of the Sum of Elements in Euclidean Space,” Diskret. Anal. Issled. Oper. 15(5), 30–43 (2008) [J. Appl. Indust. Math. 3 (3), 343–352 (2009)].

    MathSciNet  Google Scholar 

  3. E. Kh. Gimadi, A. V. Kel’manov, M. A. Kel’manova, and S. A. Khamidullin, “A Posteriori Search in a Number Sequence for the Quasiperiodically Repeating Fragment with a Given Number of Repeats,” Sibirsk. Zh. Indust. Mat. 9(1), 55–74 (2006).

    MATH  MathSciNet  Google Scholar 

  4. 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,” Diskret. Anal. Issled. Oper. 15(6), 11–19 (2008) [J. Appl. Indust. Math. 4 (1), 48–53 (2010)].

    MathSciNet  Google Scholar 

  5. A. V. Kel’manov, “AProblemof theOff-Line Detecting a Repeating Fragment in a Number Sequence,” Trudy Inst. Mat. i Mekh. Ural. Otdel. Ross. Akad. Nauk 14(2), 81–88 (2008).

    MathSciNet  Google Scholar 

  6. A. V. Kel’manov and B. Jeon, “A Posteriori Joint Detection and Discrimination of Pulses in a Quasiperiodic Pulse Train,” IEEE Trans. Signal Processing 52(3), 1–12 (2004).

    Article  MathSciNet  Google Scholar 

  7. H. Wirth, Algorithms + Data Structures = Programs (Prentice Hall, New Jersey, 1976).

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Novosibirsk State University, ul. Pirogova 2, Novosibirsk, 630090, Russia

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

  2. Sobolev Institute of Mathematics, pr. Akad. Koptyuga 4, Novosibirsk, 630090, Russia

    A. V. Kel’manov

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

Corresponding author

Correspondence to A. V. Dolgushev.

Additional information

Original Russian Text © A.V. Dolgushev, A.V. Kel’manov, 2011, published in Diskretnyi Analiz i Issledovanie Operatsii, 2011, Vol. 18, No. 2, pp. 29–40.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dolgushev, A.V., Kel’manov, A.V. An approximation algorithm for solving a problem of cluster analysis. J. Appl. Ind. Math. 5, 551–558 (2011). https://doi.org/10.1134/S1990478911040107

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

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

Keywords

Search

Navigation