Dynamic programming and convex clustering | Algorithmica Skip to main content
Springer Nature Link
Log in

Dynamic programming and convex clustering

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

In this paper the notion of convexity of clusterings for the given ordering of units is introduced. In the case when at least one (optimal) solution of the clustering problem is convex, dynamic programming leads to a polynomial algorithm with complexityO(kn 3). We prove that, for several criterion functions, convex optimal clusterings exist when dissimilarity is pyramidal for a given ordering of units.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. V. Batagelj, Optimal clusterings, Paper presented at the Fourth European Meeting of the Psychometric Society and the Classification Societies, Cambridge, 2–5 July 1985, Unpublished manuscript.

  2. P. Bertrand and E. Diday, A visual representation of the compatibility between an order and a dissimilarity index: the pyramids,Comput. Statist. Quart.,2 (1985), 31–42.

    Google Scholar 

  3. P. Brucker, On the complexity of clustering problems, inOptimization and Operations Research (R. Henn, B. Korte and W. Oettli, eds.), Lecture Notes in Economics and Mathematical Systems, Vol. 175, Springer-Verlag, Berlin, 1978, pp. 45–54.

    Google Scholar 

  4. A Ferligoj and V. Batagelj, Clustering with relational constraint,Psychometrika,47 (1982), 413–426.

    Google Scholar 

  5. W. D. Fisher, On grouping for maximum homogeneity,J. Amer. Statist. Assoc.,53 (1958), 789–798.

    Google Scholar 

  6. A. D. Gordon,Classification, Chapman & Hall, London, 1981.

    Google Scholar 

  7. D. J. Hand, Branch and bound in statistical data analysis, Manuscript, 1981.

  8. J. A. Hartigan,Clustering Algorithms, Wiley, New York, 1975.

    Google Scholar 

  9. F. K. Hwang, J. Sun, and E. Y. Yao, Optimal set partitioning,SIAM J. Algebraic Discrete Methods,6 (1985), 163–170.

    Google Scholar 

  10. R. E. Jensen, A dynamic programming algorithm for cluster analysis,Oper. Res.,17 (1969), 1034–1057.

    Google Scholar 

  11. M. R. Rao, Cluster analysis and mathematical programming,J. Amer. Statist. Assoc.,66 (1971), 622–626.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Ljubljana, Jadranska 19, 61111, Ljubljana, Slovenia

    Vladimir Batagelj & Simona Korenjak-Černe

  2. Pedagoška fakulteta Maribor, University of Maribor, Koroška c. 160, 62000, Maribor, Slovenia

    Sandi Klavžar

Authors
  1. Vladimir Batagelj
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Simona Korenjak-Černe
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sandi Klavžar
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by Jean-Daniel Boissonnat.

This research was supported in part by the Research Council of Slovenia.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Batagelj, V., Korenjak-Černe, S. & Klavžar, S. Dynamic programming and convex clustering. Algorithmica 11, 93–103 (1994). https://doi.org/10.1007/BF01182769

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01182769

Key words

Search

Navigation