Making clusterings fairer by post-processing: algorithms, complexity results and experiments

DOI10.1007/S10618-022-00893-6MaRDI QIDQ6170399zbMATH OpenFDO

Authors

Publication date 10 August 2023

Published in Data Mining and Knowledge Discovery (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10618-022-00893-6

zbMATH Keywords

algorithmsclusteringcomplexityfairnessprotected status

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Complexity and performance of numerical algorithms (65Y20) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Efficient algorithms for fair clustering with a new notion of fairness
• Algorithms for fair \(k\)-clustering with multiple protected attributes
• Fair clustering with fair correspondence distribution
• Fair coresets and streaming algorithms for fair \(k\)-means
• Achieving fair treatment in algorithmic classification

Cites work

• Balanced matrices
• Constrained Clustering
• Fairness through awareness
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1234104 (Why is no real title available?)
• scientific article; zbMATH DE number 1839431 (Why is no real title available?)
• Introduction to algorithms.
• Privacy preserving clustering with constraints

Cited in

(2)

• Efficient algorithms for fair clustering with a new notion of fairness
• Fair clustering with fair correspondence distribution

This page was built for publication: Making clusterings fairer by post-processing: algorithms, complexity results and experiments

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