Loading
Life sciences · Preprint
arXiv · September 10, 2026
Raises a question worth testing. It does not answer one.
This is a theoretical mathematics paper demonstrating that hierarchical clustering can jointly satisfy scale invariance, richness, and consistency—three axioms that Kleinberg's Impossibility Theorem showed cannot all be satisfied simultaneously by flat clustering methods. The work constructs multiple admissible hierarchical methods and characterizes their relationships, but provides no empirical validation or practical application to real-world data.
Preprint.
Hierarchical analog of scale invariance, richness, and consistency axioms are jointly satisfiable, in contrast to flat clustering impossibility Uncountably many hierarchical clustering methods satisfy these axioms (termed admissible) Several explicit constructions of admissible methods provided, including methods based on well-separated clusters and non-binary single linkage
Safety was not reported in the material analysed. Check the source before drawing any conclusion about harm.
The source did not state who this applies to in practice.
This is a theoretical mathematics paper proving existence and properties of hierarchical clustering methods satisfying axioms; it raises questions about clustering theory rather than providing empirical evidence for clinical or practical application.
Graded across the dimensions that decide whether you should act, each from what the source actually supports. There is no single score, and where a dimension was not assessed it says so.
What is missing. This record has no reported figures. That is a gap in the analysis, not a judgement about the study.
Despite its ubiquity, clustering lacks a universally accepted definition of what is a cluster. Kleinberg's Impossibility Theorem formalizes this difficulty by showing that no flat clustering method can simultaneously satisfy three natural axioms: scale invariance, richness, and consistency. In this paper, we ask whether this impossibility persists when the output is a hierarchy rather than a single partition. We show that, in contrast to the flat clustering setting, the hierarchical analog of these axioms are jointly satisfiable. In fact, there exist uncountably many hierarchical clustering methods satisfying these axioms, which we call admissible. We explicitly construct several admissible methods, including methods based on well-separated clusters and a non-binary version of single linkage. For certain pairs of admissible methods, the hierarchy produced by one always refines that produced by the other. This refinement relation defines a partial order on the class of admissible methods. This partially ordered set has no greatest element and contains uncountably many pairwise incompatible maximal elements, revealing substantial diversity among admissible methods. Nevertheless, this diversity is constrained: every admissible method contains a hierarchy of sufficiently well-separated clusters, and every finite collection of admissible methods shares such a nontrivial common backbone.
Taken from the source record, never inferred. Follow any of these and new work involving them reaches your briefing.