Skip to main content
SpringerLink
Log in

Approximation algorithm for the problem of partitioning a sequence into clusters

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

Abstract

We consider the problem of partitioning a finite sequence of Euclidean points into a given number of clusters (subsequences) using the criterion of the minimal sum (over all clusters) of intercluster sums of squared distances from the elements of the clusters to their centers. It is assumed that the center of one of the desired clusters is at the origin, while the center of each of the other clusters is unknown and determined as the mean value over all elements in this cluster. Additionally, the partition obeys two structural constraints on the indices of sequence elements contained in the clusters with unknown centers: (1) the concatenation of the indices of elements in these clusters is an increasing sequence, and (2) the difference between an index and the preceding one is bounded above and below by prescribed constants. It is shown that this problem is strongly NP-hard. A 2-approximation algorithm is constructed that is polynomial-time for a fixed number of clusters.

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. Tak-chung Fu, “A review on time series data mining,” Eng. Appl. Artificial Intelligence 24 (1), 164–181 (2011).

    Article  Google Scholar 

  2. C. Kuenzer, S. Dech, and W. Wagner, “Remote sensing time series,” Remote Sensing and Digital Image Processing (Springer, Switzerland, 2015), Vol.22.

    Google Scholar 

  3. T. W. Liao, “Clustering of time series data: A survey,” Pattern Recogn. 38 (11), 1857–1874 (2005).

    Article  MATH  Google Scholar 

  4. C. C. Aggarwal, Data Mining (Springer, Berlin, 2015).

    Book  MATH  Google Scholar 

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

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

  7. A. V. Kel’manov and L. V. Mikhailova, “A posteriori joint detection of reference fragments in a quasi-periodic sequence,” Comput. Math. Math. Phys. 48 (5), 850–865 (2008).

    Article  MathSciNet  MATH  Google Scholar 

  8. A. V. Kel’manov and S. M. Romanchenko, “An FPTAS for a vector subset search problem,” J. Appl. Ind. Math. 8 (3), 329–336 (2014).

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    A. V. Kel’manov, L. V. Mikhailova, S. A. Khamidullin & V. I. Khandeev

  2. Novosibirsk State University, Novosibirsk, 630090, Russia

    A. V. Kel’manov & V. I. Khandeev

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

    You can also search for this author in PubMed Google Scholar

  2. L. V. Mikhailova
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. S. A. Khamidullin
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. V. I. Khandeev
    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, L.V. Mikhailova, S.A. Khamidullin, V.I. Khandeev, 2017, published in Zhurnal Vychislitel’noi Matematiki i Matematicheskoi Fiziki, 2017, Vol. 57, No. 8, pp. 1392–1400.

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., Mikhailova, L.V., Khamidullin, S.A. et al. Approximation algorithm for the problem of partitioning a sequence into clusters. Comput. Math. and Math. Phys. 57, 1376–1383 (2017). https://doi.org/10.1134/S0965542517080085

Download citation

  • Received:

  • Published:

  • Issue Date:

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

Keywords

Search

Navigation