Abstract
In the election of a hierarchical clustering method, theoretic properties may give some insight to determine which method is the most suitable to treat a clustering problem. Herein, we study some basic properties of two hierarchical clustering methods: α-unchaining single linkage or SL(α) and a modified version of this one, SL∗(α). We compare the results with the properties satisfied by the classical linkage-based hierarchical clustering methods.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
ACKERMAN, M., BEN-DAVID, S., and LOKER, D. (2010a), “Towards Property-Based Algorithms Among Hierarchical Clustering Methods”, Advances in Neural Information Processing Systems, 23, 10–18.
ACKERMAN, M., BEN-DAVID, S., and LOKER,D. (2010b), “Characterization of Linkage-Based Clustering”, Proceedings of the 23rd International Conference on Learning Theory (COLT).
ACKERMAN, M., BEN-DAVID, S., BRANZEI, S., and LOKER, D. (2012), “Weighted Clustering,” Proceedings of the 26th AAAI Conference on Artificial Intelligence.
BURAGO, D., BURAGO, Y., and IVANOV, S. (2001), “A Course in Metric Geometry,” in Graduate Studies in Mathematics 33, Providence RI: AMS.
CARLSSON, G., and MÉMOLI, F. (2008), “Persistent Clustering and a Theorem of J. Kleinberg,” ArXiv:0808.2241.
CARLSSON, G., and MÉMOLI, F. (2010), “Characterization, Stability and Convergence of Hierarchical Clustering Methods,” Journal of Machine Learning Research, 11, 1425–1470.
FISHER, L., and VAN NESS, J. (1971), “Admissible Clustering Procedures,” Biometrika, 58, 91–104.
GROMOV, M. (2007), Metric Structures for Riemannian and Non-Riemannian Spaces, Modern Birkhäuser Classics, Boston MA: Birkhäuser Boston Inc.
HUGHES, B. (2004), “Trees and Ultrametric Spaces: A Categorical Equivalence,” Advances in Mathematics, 189, 148–191.
KLEINBERG, J.M. (2002), “An Impossibility Theorem for Clustering,” in Advances in Neural Information Processing Systems 15 (NIPS 2002), eds. S. Becker, S. Thrun, and K. Obermayer, Cambridge MA: MIT Press, pp. 446–453.
MARTÍNEZ-PÉREZ, A., and MORÓN M.A. (2009), “Uniformly Continuous Maps Between Ends of R-trees”, Mathematische Zeitschrift, 263(3), 583–606.
MARTÍNEZ-PÉREZ, A. (2013), “A Density-Sensitive Hierarchical Clustering Method,” arXiv:1210.6292v2 [cs.LG].
MARTÍNEZ-PÉREZ, A. (2015), “Gromov-Hausdorff Stability of Linkage-Based Hierarchical Clustering Methods,” Advances in Mathematics, to appear.
MURTAGH, F. (1983), “A Survey of Recent Advances in Hierarchical Clustering Algorithms”, The Computer Journal, 26(4), 354–359.
WISHART, D. (1969), “Mode Analysis: A Generalization of Nearest Neighbor Which Reduces Chaining Effects”, in Numerical Taxonomy, ed. A.J. Cole, New York: Academic Press, pp. 282–311.
ZADEH, R.B., and BEN-DAVID, S. (2009), “A Uniqueness Theorem for Clustering”, Proceedings of the 25th Conference on Uncertainty in Artificial Intelligence (UAI), arXiv:1205.2600 [cs.LG].
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Martínez-Pérez, A. On the Properties of α-Unchaining Single Linkage Hierarchical Clustering. J Classif 33, 118–140 (2016). https://doi.org/10.1007/s00357-016-9198-2
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00357-016-9198-2