11 citations · 41 across the 9 of their papers we have counts for
10 papers
A Scalable Algorithm for Individually Fair K-means Clustering
MohammadHossein Bateni, Vincent Cohen-Addad, Alessandro Epasto +1
We present a scalable algorithm for the individually fair (, )-clustering problem introduced by Jung et al. and Mahabadi et al. Given points in a metric space, let $δ…
Metric Clustering and MST with Strong and Weak Distance Oracles
MohammadHossein Bateni, Prathamesh Dharangutte, Rajesh Jayaram +1
We study optimization problems in a metric space where we can compute distances in two ways: via a ''strong'' oracle that returns exact distances , and a…
Optimal Fully Dynamic -Center Clustering for Adaptive and Oblivious Adversaries
MohammadHossein Bateni, Hossein Esfandiari, Hendrik Fichtenberger +4
In fully dynamic clustering problems, a clustering of a given data set in a metric space must be maintained while it is modified through insertions and deletions of individual poin…
Agile Modeling: From Concept to Classifier in Minutes
Otilia Stretcu, Edward Vendrow, Kenji Hata +15
The application of computer vision to nuanced subjective use cases is growing. While crowdsourcing has served the vision community well for most objective tasks (such as labeling a…
Optimal Fully Dynamic -Centers Clustering
MohammadHossein Bateni, Hossein Esfandiari, Rajesh Jayaram +1
We present the first algorithm for fully dynamic -centers clustering in an arbitrary metric space that maintains an optimal approximation in $O(k \cdot \operatorname{polyl…
Distributed Coverage Maximization via Sketching
MohammadHossein Bateni, Hossein Esfandiari, Vahab Mirrokni
Coverage problems are central in optimization and have a wide range of applications in data mining and machine learning. While several distributed algorithms have been developed fo…