Fair coresets and streaming algorithms for fair k-means

DOI10.1007/978-3-030-39479-0_16MaRDI QIDQ2193095zbMATH OpenOpenAlexFDO

Authors Melanie Schmidt, Chris Schwiegelshohn, Christian Sohler

Publication date 24 August 2020

Full work available at URL https://doi.org/10.1007/978-3-030-39479-0_16

Mathematics Subject Classification ID

Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)

Recommendations

• On coresets for fair clustering in metric and Euclidean spaces and their applications
• Algorithms for fair \(k\)-clustering with multiple protected attributes
• Efficient algorithms for fair clustering with a new notion of fairness
• A streaming algorithm for k-means with approximate coreset
• On coresets for k-means and k-median clustering

Cited in

(22)

• Algorithms for fair \(k\)-clustering with multiple protected attributes
• On the \(k\)-means/median cost function
• On the cost of essentially fair clusterings
• Efficient algorithms for fair clustering with a new notion of fairness
• Attraction-repulsion clustering: a way of promoting diversity linked to demographic parity in fair clustering
• Approximation algorithms for the individually fair k-center with outliers
• Convergence rates of the stochastic alternating algorithm for bi-objective optimization
• Fair clustering with fair correspondence distribution
• On coresets for fair clustering in metric and Euclidean spaces and their applications
• Making clusterings fairer by post-processing: algorithms, complexity results and experiments
• FPT approximation for capacitated clustering with outliers
• On sampling based algorithms for k-means
• Coresets for k-median of lines with group fairness constraints
• Moderate dimension reduction for k-center clustering
• An empirical evaluation of k-means coresets
• On coresets for fair clustering in metric and Euclidean spaces and their applications
• Efficient coreset construction algorithm for fair k-median of lines
• Coresets for weight-constrained anisotropic assignment and clustering
• Polynomial-time constant-approximation for fair sum-of-radii clustering
• Connected k-median with disjoint and non-disjoint clusters
• Coresets for robust clustering via black-box reductions to vanilla case
• Fair correlation clustering with global and local guarantees

This page was built for publication: Fair coresets and streaming algorithms for fair \(k\)-means

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2193095)