activity
20162020
most citedClustering without Over-Representation

83 citations · 116 across the 6 of their papers we have counts for

collaborators

6 papers

cs.DS2020★ 21 cited

Fair Hierarchical Clustering

Sara Ahmadian, Alessandro Epasto, Marina Knittel +6

As machine learning has become more prevalent, researchers have begun to recognize the necessity of ensuring machine learning systems are fair. Recently, there has been an interest…

cs.DS2020★ 7 cited

Fair Correlation Clustering

Sara Ahmadian, Alessandro Epasto, Ravi Kumar +1

In this paper, we study correlation clustering under fairness constraints. Fair variants of -median and -center clustering have been studied recently, and approximation algor…

cs.DS2020★ 4 cited

Fair Correlation Clustering

Saba Ahmadi, Sainyam Galhotra, Barna Saha +1

In this paper we study the problem of correlation clustering under fairness constraints. In the classic correlation clustering problem, we are given a complete graph where each edg…

math.ST2019

Testing Mixtures of Discrete Distributions

Maryam Aliakbarpour, Ravi Kumar, Ronitt Rubinfeld

There has been significant study on the sample complexity of testing properties of distributions over large domains. For many properties, it is known that the sample complexity can…

cs.DS2019★ 83 cited

Clustering without Over-Representation

Sara Ahmadian, Alessandro Epasto, Ravi Kumar +1

In this paper we consider clustering problems in which each point is endowed with a color. The goal is to cluster the points to minimize the classical clustering cost but with the…

cs.CL2016★ 1 cited

Conversational flow in Oxford-style debates

Justine Zhang, Ravi Kumar, Sujith Ravi +1

Public debates are a common platform for presenting and juxtaposing diverging views on important issues. In this work we propose a methodology for tracking how ideas flow between p…