arXiv Machine Learning July 28, 2026 By Kai Ming Ting, Kaifeng Zhang, Sanjay Chawla

Why does Greedy Search produce Optimal Clustering Outcomes? A Fixed-Core Assignment Theory

Read the original on arXiv Machine Learning →

arXiv:2607. 24237v1 Announce Type: new Abstract: Many existing clustering methods are designed based on a set-oriented definition---a cluster is a set of similar points---relying a point-to-point similarity function to find similar points.

Summary generated by The Flow from the publisher's feed. The full article lives at arXiv Machine Learning.

arXiv Machine Learning

Jun 5

Central Description Length (CDL) Clustering Validation Index

arXiv:2606. 05230v1 Announce Type: cross Abstract: Selecting a clustering algorithm and its hyperparameters without labels is a common difficulty in engineering machine learning pipelines that work with unsupervised analysis of sensor, image, or process data.

By Mahdi Shamsi, Soosan Beheshti

rag benchmarks

arXiv Machine Learning

Aug 5

Strong bounds for large-scale Minimum Sum-of-Squares Clustering

arXiv:2502. 08397v3 Announce Type: replace-cross Abstract: Clustering is a fundamental technique in data analysis and machine learning, used to group similar data points together.

By Anna Livia Croella, Veronica Piccialli, Antonio M. Sudoso

arXiv Machine Learning

Jul 7

Sensitivity Sampling with Predictions for k-Means Clustering

arXiv:2607. 04949v1 Announce Type: new Abstract: We study the problem of k-means clustering on large datasets.

By Cristian Boldrin, Fabio Vandin

benchmarks

arXiv Machine Learning

Jun 18

Seed-Guided Semi-Supervised Clustering by A-Contrario Anomaly Detection

arXiv:2606. 18833v1 Announce Type: new Abstract: This paper introduces a semi-supervised clustering framework grounded in the statistical duality between grouping principles and anomaly detection.

By Nassir Mohammad

rag benchmarks

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

arXiv Machine Learning

Jun 18

FOSC-X: An Extended Framework for Optimal Local Cuts and Non-Horizontal Cluster Selection from Clustering Hierarchies

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

efficiency

Related stories

Central Description Length (CDL) Clustering Validation Index

Strong bounds for large-scale Minimum Sum-of-Squares Clustering

Sensitivity Sampling with Predictions for k-Means Clustering

Seed-Guided Semi-Supervised Clustering by A-Contrario Anomaly Detection

The K-SCAN Clustering Algorithm

FOSC-X: An Extended Framework for Optimal Local Cuts and Non-Horizontal Cluster Selection from Clustering Hierarchies