39 citations · 129 across the 23 of their papers we have counts for
13 papers · 1 filter
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…
Scalable Distributed Approximation of Internal Measures for Clustering Evaluation
Federico Altieri, Andrea Pietracaprina, Geppino Pucci +1
The most widely used internal measure for clustering evaluation is the silhouette coefficient, whose naive computation requires a quadratic number of distance calculations, which i…
Coreset-based Strategies for Robust Center-type Problems
Andrea Pietracaprina, Geppino Pucci, Federico Soldà
Given a dataset of points from some metric space, the popular -center problem requires to identify a subset of points (centers) in minimizing the maximum distance of…