Skip to main content
SpringerLink
Log in

On the complexity of some data analysis problems

  • Published:
Computational Mathematics and Mathematical Physics Aims and scope Submit manuscript

Abstract

NP-completeness of certain discrete optimization problems is proved. These are the problems to which one can reduce some important problems arising in data analysis when certain subsets of vectors are sought.

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 and P. Hansen, “On the Complexity of Minimum Sum-of-Squares Clustering,” Les Cahiers du GERAD, G-2007-50, 2007 (2007).

  2. D. Aloise, A. Deshpande, P. Hansen, and P. Popat, “NP-Hardness of Euclidean Sum-of-Squares Clustering,” Les Cahiers du GERAD, G-2008-33 (2008).

  3. M. Mahajan, P. Nimbhorkar, and K. Varadarajan, “The Planar k-Means Problem Is NP-Hard,” Lect. Notes Comput. Sci. 5431, 284–285 (2009).

    Google Scholar 

  4. A. V. Dolgushev and A. V. Kel’manov, “On the Algorithmic Complexity of a Cluster Analysis Problem,” Diskretn. Analiz Issl. Operat. 17(2), 39–45 (2010).

    MathSciNet  Google Scholar 

  5. J. B. MacQueen, Some Methods for Classification and Analysis of Multivariate Observations, in Proc. 5th Berkeley Symp. on Mathematical Statistics and Probability, 1967, Vol. 1, pp. 281–297.

    MathSciNet  Google Scholar 

  6. E. Kh. Gimadi, A. V. Kel’manov, M. A. Kel’manova, and S. A. Khamidullin, “A Posteriori Detection of a Quasi-Periodic Fragment in a Number Sequence Given a Number of Repetitions,” Sib. Zh. Industr. Mat. 9(1(25)), 55–74 (2006).

    MathSciNet  Google Scholar 

  7. A. E. Baburin, E. Kh. Gimadi, N. I. Glebov, and A. V. Pyatkin, “The Problem of Finding a Subset of Vectors Having the Maximum Total Weight,” Diskretn. Analiz Issl. Operat., Ser. 2 14(1), 32–42 (2007).

    MathSciNet  Google Scholar 

  8. A. V. Kel’manov and A. V. Pyatkin, “On the Complexity of a Search for a Subset of “Similar” Vectors,” Dokl. Akad. Nauk 421, 590–592 (2008) [Dokl. 78, 574–575 (2008)].

    MathSciNet  Google Scholar 

  9. A. V. Kel’manov and A. V. Pyatkin, “On a Variant of the Problem of Choosing a Subset of Vectors,” Diskretn. Analiz Issl. Operat. 15(5), 25–40 (2008).

    MathSciNet  Google Scholar 

  10. A. V. Kel’manov and A. V. Pyatkin, “Complexity of Certain Problems of Searching for Subsets of Vectors and Cluster Analysis,” Zh. Vychisl. Mat. Mat. Fiz. 49(11), 2059–2067 (2009) [Comput. Math. Math. Phys. 49, 1966–1971 (2009)].

    MathSciNet  Google Scholar 

  11. 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 

  12. A. V. Kel’manov and S. A. Khamidullin, “Posterior Detection of a Given Number of Identical Subsequences in a Quasi-Periodic Sequence,” Zh. Vychisl. Mat. Mat. Fiz. 41(5), 807–820 (2001) [Comput. Math. Math. Phys. 41, 762–774 (2001)].

    MathSciNet  Google Scholar 

  13. A. V. Kel’manov and L. V. Mikhailova, “Joint Detection of a Given Number of Reference Fragments in a Quasi-Periodic Sequence and Its Partition into Segments Containing Series of Identical Fragments,” Zh. Vychisl. Mat. Mat. Fiz. 46(1), 172–189 (2006) [Comput. Math. Math. Phys. 46, 165–181 (2006)].

    MATH  MathSciNet  Google Scholar 

  14. A. V. Kel’manov, L. V. Mikhailova, and S. A. Khamidullin, “Aposteriornoe obnaruzhenie v kvaziperiodicheskoi posledovatel’nosti povtoryayushchegosya nabora etalonnykh fragmentov,” Zh. Vychisl. Mat. Mat. Fiz. 48(12), 168–184 (2008) [Comput. Math. Math. Phys. 48, 2276–2292 (2006)].

    MathSciNet  Google Scholar 

  15. A. V. Kel’manov, “Polynomially Solvable and NP-hard Variants of the Problem of Optimal Detection of a Repeating Fragment in a Number Sequence,” in Proc. of the Russian Conf. on Discrete Optimization and Operations Research, Vladivostok, 2007 (Institut Matematiki, Sib. Otd. Ross. Akad. Nauk, Novosibirsk, 2007) [in Russian].

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sobolev Institute of Mathematics, Siberian Branch, Russian Academy of Sciences, pr. akademika Koptyuga 4, Novosibirsk, 630090, Russia

    A. V. Kel’manov

Authors
  1. A. V. Kel’manov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. V. Kel’manov.

Additional information

Original Russian Text © A.V. Kel’manov, 2010, published in Zhurnal Vychislitel’noi Matematiki i Matematicheskoi Fiziki, 2010, Vol. 50, No. 11, pp. 2045–2051.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kel’manov, A.V. On the complexity of some data analysis problems. Comput. Math. and Math. Phys. 50, 1941–1947 (2010). https://doi.org/10.1134/S0965542510110163

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

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

Keywords

Search

Navigation