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
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. We relax the halting condition of the recursive process to stop whenever the remaining cluster is a graph belonging to a class $\mathcal{F}$.
arXiv:2608.21466v1 Announce Type: new
Abstract: We develop spectral algorithms for selecting state-space partitions that define averaging kernels for finite, ergodic and reversible Markov chains. For...
By Michael C. H. Choi, Youjia Wang
arXiv:2607. 01993v1 Announce Type: cross Abstract: The silhouette is one of the most widely used measures to assess the quality of a $k$-clustering of a dataset of $n$ elements.
By Ilie Sarpe, Federico Altieri, Andrea Pietracaprina, Geppino Pucci, Fabio Vandin
arXiv:2412. 03008v2 Announce Type: replace-cross Abstract: Local/seeded clustering aims to find a compact cluster near the given starting instances.
By Zihao Li, Dongqi Fu, Hengyu Liu, Jingrui He
arXiv:2409. 10908v3 Announce Type: replace-cross Abstract: Recovering the underlying $k$-clustering of a set $U$ of $n$ points by asking pair-wise same-cluster queries has garnered significant interest in the past few years.
By Hadley Black, Euiwoong Lee, Arya Mazumdar, Barna Saha