Fair coresets and streaming algorithms for fair k-means

DOI10.1007/978-3-030-39479-0_16OpenAlexW3002138439MaRDI QIDQ2193095FDOQ2193095

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

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

Mathematics Subject Classification ID

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

Cited In (12)

• Fair clustering with fair correspondence distribution
• Approximation algorithms for the individually fair \(k\)-center with outliers
• Fair correlation clustering with global and local guarantees
• On coresets for fair clustering in metric and Euclidean spaces and their applications
• Making clusterings fairer by post-processing: algorithms, complexity results and experiments
• Efficient algorithms for fair clustering with a new notion of fairness
• On the cost of essentially fair clusterings
• Attraction-repulsion clustering: a way of promoting diversity linked to demographic parity in fair clustering
• Convergence rates of the stochastic alternating algorithm for bi-objective optimization
• On the \(k\)-means/median cost function
• Algorithms for fair \(k\)-clustering with multiple protected attributes
• FPT approximation for capacitated clustering with outliers

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)