arXiv Machine Learning By Cristian Boldrin, Fabio Vandin

Sensitivity Sampling with Predictions for k-Means Clustering

Read the original on arXiv Machine Learning →

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

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning
Jun 16

Active Learning with Low-Rank Structure for Data Selection

arXiv:2606. 16045v1 Announce Type: new Abstract: In the data selection problem, the objective is to choose a small, representative subset of data that can be used to efficiently train a machine learning model.

By Vincent Cohen-Addad, Sasidhar Kunapuli, Vahab Mirrokni, Mahdi Nikdan, David P. Woodruff, Samson Zhou
arXiv Machine Learning
Sep 10

A Sub-4 Approximation for Fair $k$-Means

arXiv:2609.07974v1 Announce Type: cross Abstract: Fairness in clustering has attracted sustained research interest, motivated by the need to ensure equitable representation of protected groups in mac...

By Kangke Cheng, Guanlin Mo, Shihong Song, Hu Ding