39 citations · 89 across the 21 of their papers we have counts for
24 papers
Streaming algorithms for robust max-min diversification
Andrea Pietracaprina, Geppino Pucci, Stefano Zanon
Given a set of points in a metric space and an integer , max-min diversification aims to select points of maximizing their minimum pairwise distance. This object…
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…
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…
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…
Fully dynamic clustering and diversity maximization in doubling metrics
Paolo Pellizzoni, Andrea Pietracaprina, Geppino Pucci
We present approximation algorithms for some variants of center-based clustering and related problems in the fully dynamic setting, where the pointset evolves through an arbitrary…
Distributed k-Means with Outliers in General Metrics
Enrico Dandolo, Andrea Pietracaprina, Geppino Pucci
Center-based clustering is a pivotal primitive for unsupervised learning and data analysis. A popular variant is undoubtedly the k-means problem, which, given a set of points f…