3 papers
cs.DS2026
Scalable and Distributed Silhouette Approximation
Ilie Sarpe, Federico Altieri, Andrea Pietracaprina +2
The silhouette is one of the most widely used measures to assess the quality of a -clustering of a dataset of elements. Its evaluation requires no information beyond the clu…
cs.DS2026
Dynamic k-center clustering with lifetimes
Simone Moretti, Paolo Pellizzoni, Andrea Pietracaprina +1
The -center problem is a fundamental clustering variant with applications in learning systems and data summarization. In several real-world scenarios, the dataset to be clustere…
cs.DS2025
Fair Center Clustering in Sliding Windows
Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci +1
The -center problem requires the selection of points (centers) from a given metric pointset so to minimize the maximum distance of any point of from the closest cent…