← Back to all news
arXiv Statistics ML October 27, 2026 By Marek Gagolewski

Lumbermark: Resistant Clustering by Chopping Up Mutual Reachability Minimum Spanning Trees

Read the original on arXiv Statistics ML →

The Flow has not summarised this story yet — read it at arXiv Statistics ML.

  • benchmarks

One email a morning, machine-written

One email a day, machine-written, one click to leave. We never share your address.

Related stories

arXiv Machine Learning
Jul 10

Persistent Multiscale Density-based Clustering

arXiv:2512. 16558v3 Announce Type: replace Abstract: Clustering is a cornerstone of modern data analysis.

By Dani\"el Bot, Leland McInnes, Jan Aerts
efficiency
More like this →
arXiv Machine Learning
Jul 28

The K-SCAN Clustering Algorithm

arXiv:2607. 24537v1 Announce Type: new Abstract: In the Big Data era, the scalability of clustering algorithms constitutes a key challenge.

By Filip Kosiorowski, Grzegorz Sroka
efficiency
More like this →
arXiv Machine Learning
Jul 16

Hierarchical $\mathcal{F}$-Clustering: Approximation and Hardness of Clustering into Trees and Bounded Diameter Graphs

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
More like this →
arXiv Machine Learning
Jun 30

Minimum Description Length based Granular-Ball Tree Regularization for Spectral Clustering

arXiv:2605. 22410v2 Announce Type: replace Abstract: Spectral clustering largely depends on the affinity graph, yet constructing a graph that preserves reliable local connectivity while adapting to heterogeneous data structures remains challenging.

By Zeqiang Xian, Caihui Liu, Yong Zhang, Wenjing Qiu
More like this →
arXiv AI
Aug 18

Stop Indexing at Full Precision: Revisiting Clustering for Vector Embeddings

arXiv:2608. 14648v1 Announce Type: cross Abstract: In this study, we revisit three widely used techniques in vector search and utilize them to optimize vector embedding indexing through clustering: dimensionality reduction, quantization, and dimension pruning.

By Leonardo Kuffo, Peter Boncz
ragefficiency
More like this →
arXiv Machine Learning
Jun 10

ClusBench: The Clustering Benchmark Data Resource You've All Been Waiting For (?)

arXiv:2606. 10673v1 Announce Type: cross Abstract: Although some very common test beds exist for assessing the performance of clustering methods, large scale benchmarking is typically limited to relatively simplistic simulation set-ups.

By David P. Hofmeyr
benchmarks
More like this →
About Pricing API Newsletter Sources Privacy Terms Refunds Accessibility Provider info Contact RSS

The Flow links to publishers and never republishes their articles. Summaries are machine-generated.

v1.1.0 · 5f852ea