arXiv:2607. 13217v1 Announce Type: cross Abstract: Consider the following variation on the Hierarchical Clustering problem: Usually, while building a hierarchical clustering, one recursively partitions the data until each cluster becomes a singleton.
By Micha{\l} Szyfelbein, Dariusz Dereniowski
arXiv:2604. 23628v2 Announce Type: replace-cross Abstract: Hierarchical clustering is a fundamental task in data analysis, but classical methods have long lacked a principled objective function.
By Ryuki Tsukuba, Kazutoshi Ando
arXiv:2602. 08542v3 Announce Type: replace-cross Abstract: Given a weighted undirected graph, a number of clusters $k$, and an exponent $z$, the goal in the $(k, z)$-clustering problem on graphs is to select $k$ vertices as centers that minimize the sum of the distances raised to the power $z$ of each vertex to its closest center.
By Emilio Cruciani, Sebastian Forster, Antonis Skarlatos
Extracting a flat clustering solution from a hierarchy is a common task in practical cluster analysis and can be formulated as an optimisation problem. Existing approaches focus on finding a single optimal solution.
arXiv:2606. 18972v1 Announce Type: cross Abstract: Extracting a flat clustering solution from a hierarchy is a common task in practical cluster analysis and can be formulated as an optimisation problem.
By Connor Simpson, Ricardo J. G. B. Campello
The paper investigates whether the impossibility results for flat clustering—specifically Kleinberg’s axioms of scale invariance, richness, and consistency—extend to hierarchical clustering. It demonstrates that, unlike the flat case, there exist uncountably many hierarchical clustering methods that satisfy all three axioms, termed admissible methods. The authors construct several such methods, explore a refinement partial order among them, and show that while the set of admissible methods is diverse, every method shares a common backbone of well‑separated clusters.