Skip to main content

Stable Clusterings and the Cones of Outer Normals

  • Conference paper
  • First Online:
Operations Research Proceedings 2017

Part of the book series: Operations Research Proceedings ((ORP))

  • 2082 Accesses

Abstract

We consider polytopes that arise in the cluster analysis of a finite set of data points. These polytopes encode all possible clusterings and their vertices correspond to clusterings that admit a power diagram, which is a polyhedral separation of the underlying space where each cluster has its own cell. We study the edges of these polytopes and show that they encode cyclical transfers of elements between clusters. We use this characterization to obtain a relation between power diagrams and the volume of the cones of outer normals of the respective clustering. This allows us to derive a new stability criterion for clusterings, which can be used to measure the dependability of the clustering for decision-making. Further, the results explain why many popular clustering algorithms work so well in practice.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Barnes, E. R., Hoffman, A. J., & Rothblum, U. G. (1992). Optimal partitions having disjoint convex and conic hulls. Mathematical Programming, 54(1), 69–86. https://doi.org/10.1007/BF01586042.

  2. Bonifas, N., Di Summa, M., Eisenbrand, F., Hähnle, N., & Niemeier, M. (2014). On sub-determinants and the diameter of polyhedra. Discrete and Computational Geometry, 52(1), 102–115. https://doi.org/10.1007/s00454-014-9601-x.

  3. Borgwardt, S. (2010). A Combinatorial Optimization Approach to Constrained Clustering. Ph.D. thesis. Technische Universität München.

    Google Scholar 

  4. Brieden, A., & Gritzmann, P. (2012). On optimal weighted balanced clusterings: gravity bodies and power diagrams. SIAM Journal on Discrete Mathematics, 26(2), 415–434. https://doi.org/10.1137/110832707.

  5. Fukuda, K., Onn, S., & Rosta, V. (2003). An adaptive algorithm for vector partitioning. Journal of Global Optimization, 25(3), 305–319. https://doi.org/10.1023/A:1022417803474.

Download references

Acknowledgements

I am grateful to my master’s thesis advisor Steffen Borgwardt for introducing me to this exciting topic and for the continuous support.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Felix Happach .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Happach, F. (2018). Stable Clusterings and the Cones of Outer Normals. In: Kliewer, N., Ehmke, J., Borndörfer, R. (eds) Operations Research Proceedings 2017. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-319-89920-6_6

Download citation

Publish with us

Policies and ethics