24 citations · 29 across the 7 of their papers we have counts for
5 papers · 1 filter
Diversity-aware clustering: Computational Complexity and Approximation Algorithms
Suhas Thejaswi, Ameet Gadekar, Bruno Ordozgoiti +1
In this work, we study diversity-aware clustering problems where the data points are associated with multiple attributes resulting in intersecting groups. A clustering solution nee…
Clustering with fair-center representation: parameterized approximation algorithms and heuristics
Suhas Thejaswi, Ameet Gadekar, Bruno Ordozgoiti +1
We study a variant of classical clustering formulations in the context of algorithmic fairness, known as diversity-aware clustering. In this variant we are given a collection of fa…
Diversity-aware -median : Clustering with fair center representation
Suhas Thejaswi, Bruno Ordozgoiti, Aristides Gionis
We introduce a novel problem for diversity-aware clustering. We assume that the potential cluster centers belong to a set of groups defined by protected attributes, such as ethnici…
Discovering Polarized Communities in Signed Networks
Francesco Bonchi, Edoardo Galimberti, Aristides Gionis +2
Signed networks contain edge annotations to indicate whether each interaction is friendly (positive edge) or antagonistic (negative edge). The model is simple but powerful and it c…
Reconciliation k-median: Clustering with Non-Polarized Representatives
Bruno Ordozgoiti, Aristides Gionis
We propose a new variant of the k-median problem, where the objective function models not only the cost of assigning data points to cluster representatives, but also a penalty term…