Skip to main content
Log in

A Randomized Algorithm for a Sequence 2-Clustering Problem

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

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 centers. The center of one cluster is unknown and is defined as the mean value of all points in the cluster. The center of the other cluster is the origin. Additionally, the difference between the indices of two consequent points from the first cluster is bounded from below and above by some constants. A randomized algorithm that finds an approximation solution of the problem in polynomial time for given values of the relative error and failure probability and for an established parameter value is proposed. The conditions are established under which the algorithm is polynomial and asymptotically exact.

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

Access this article

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. V. Kel’manov and S. A. Khamidullin, “Posterior detection of a given number of identical subsequences in a quasi-periodic sequence,” Comput. Math. Math. Phys. 41 (5), 762–774 (2001).

    MathSciNet  MATH  Google Scholar 

  2. A. V. Kel’manov and B. Jeon, “A posteriori joint detection and discrimination of pulses in a quasiperiodic pulse train,” IEEE Trans. Signal Process. 52 (3), 645–656 (2004).

    Article  MathSciNet  MATH  Google Scholar 

  3. J. A. Carter, E. Agol, et al., “Kepler-36: A pair of planets with neighboring orbits and dissimilar densities,” Science 337, 556–559 (2012).

    Article  Google Scholar 

  4. M. C. Bishop, Pattern Recognition and Machine Learning (Springer Science + Business Media, New York, 2006).

  5. A. V. Kel’manov and S. A. Khamidullin, “An approximation polynomial-time algorithm for a sequence bi-clustering problem,” Comput. Math. Math. Phys. 55 (6), 1068–1076 (2015).

    Article  MathSciNet  MATH  Google Scholar 

  6. Tak-chung Fu, “A review on time series data mining,” Eng. Appl. Artificial Intelligence 24 (1), 164–181 (2011).

    Article  Google Scholar 

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

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

  9. A. V. Kel’manov, “Off-line detection of a quasi-periodically recurring fragment in a numerical sequence,” Proc. Steklov Inst. Math. 263, Suppl. 2, 84–92 (2008).

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  11. A. V. Kel’manov and A. V. Pyatkin, “On complexity of some problems of cluster analysis of vector sequences,” J. Appl. Ind. Math. 7 (3), 363–369 (2013).

    Article  MathSciNet  MATH  Google Scholar 

  12. A. V. Kel’manov and S. A. Khamidullin, “An approximating polynomial algorithm for a sequence partitioning problem,” J. Appl. Ind. Math. 8 (2), 236–244 (2014).

    Article  MathSciNet  MATH  Google Scholar 

  13. R. Motwani and P. Raghavan, Randomized Algorithms (Cambridge Univ. Press, New York, 1995).

    Book  MATH  Google Scholar 

  14. A. V. Kel’manov, S. A. Khamidullin, and V. I. Khandeev, “Exact pseudopolynomial algorithm for a sequence bi-clustering problem,” Proceedings of 15th All-Russia Conference on Mathematical Programming and Applications (Yekaterinburg, 2015), pp. 139–140.

  15. A. V. Kel’manov, S. A. Khamidullin, and V. I. Khandeev, “Fully polynomial-time approximation scheme for a sequence 2-clustering problem,” Diskret. Anal. Issled. Oper. 23 (2), 21–40 (2016).

    MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

Download references

ACKNOWLEDGMENTS

This work was supported by the Russian Science Foundation, project no. 16-11-10041.

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to A. V. Kel’manov, S. A. Khamidullin or V. I. Khandeev.

Additional information

Translated by I. Ruzanova

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kel’manov, A.V., Khamidullin, S.A. & Khandeev, V.I. A Randomized Algorithm for a Sequence 2-Clustering Problem. Comput. Math. and Math. Phys. 58, 2078–2085 (2018). https://doi.org/10.1134/S0965542518120138

Download citation

  • Received:

  • Published:

  • Issue Date:

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

Keywords:

Navigation