F3KM: Federated, Fair, and Fast k-means

This paper proposes a federated, fair, and fast 𝑘-means algorithm (F 3 KM) to solve the fair clustering problem efficiently in scenarios where data cannot be shared among different parties. The proposed algorithm decomposes the fair 𝑘-means problem into multiple subproblems and assigns each subproblem to a client for local computation. Our algorithm allows each client to possess multiple sensitive attributes (or have no sensitive attributes). We propose an in-processing method that employs the alternating direction method of multipliers (ADMM) to solve each subproblem. During the procedure of solving subproblems, only the computation results are exchanged between the server and the clients, without exchanging the raw data. Our theoretical analysis shows that F 3 KM is efficient in terms of both communication and computation complexities. Specifically, it achieves a better trade-off between utility and communication complexity, and reduces the computation complexity to linear with respect to the dataset size. Our experiments show that F 3 KM achieves a better trade-off between utility and fairness than other methods. Moreover, F 3 KM is able to cluster five million points in one hour, highlighting its impressive efficiency.