In the distributed fair k-center problem with outliers, the data points of V are stored on T machines and the goal is to choose a set S of k points and a set Z of z points such that \max _{i\in V \backslash Z} d(i,S) is minimized.
Mar 16, 2022
Jul 28, 2023 · In this paper, we study two fair clustering problems: the centralized fair k -center problem with outliers and the distributed fair k -center ...
Dec 17, 2021 · In this work, we design new distributed algorithms for the fair k-center problem with outliers. Our main contributions are:
Although prior works studied the fair k-center cluster- ing problem, they do not consider outliers. This paper yields a linear time algorithm that satisfies the ...
Nov 21, 2024 · In this paper, we study two fair clustering problems: the centralized fair k -center problem with outliers and the distributed fair k -center ...
In this work, we consider the widely used k-center clustering problem and its variant used to handle noisy data, k-center with outliers.
Missing: Fair | Show results with:Fair
In this work, we design new distributed algorithms for the fair k-center problem with outliers. Our main contributions are: (1) In the fair k-center problem ...
May 27, 2024 · In this paper, we consider the fair k-center problem with outliers and capacity constraints, denoted as the fair k-center with outliers (FkCO) ...
People also ask
Is Kmeans clustering sensitive to outliers?
How do you deal with outliers in clustering?
Feb 15, 2022 · We study the problem of k-clustering with fair outlier removal and provide the first approximation algorithm for well-known clustering formulations.
In this work, we consider the k-center and k-center with outliers problems in the distributed computing setting. Although the algorithms are highly parallel ...
Missing: Fair | Show results with:Fair