Fairness in Clustering Algorithms
Thursday, 02 January 2020
11:00 - 11:45
Clustering is a fundamental problem in unsupervised machine learning. The goal of this problem is to partition a set of given data points so that similar points are grouped together. In this talk, I'll give an overview of several ways to formalize this problem and algorithms that have been proposed to solve them. Many applications of clustering require the solution to satisfy additional desirable properties such as fairness. I will give a formal definition of clustering with fairness, and present a number of recent results in this area.
Mohammad Mahdian is a research scientist at the Google Research lab in New York, specializing in market algorithms. He has a Ph.D. from MIT, an M.Sc. from University of Toronto, and a B.Sc. from Sharif University of Technology. Prior to Google, he has worked at Yahoo! Research and Microsoft Research