Fair Minimum Representation Clustering via Integer Programming
<|reference_start|>Fair Minimum Representation Clustering via Integer Programming: Clustering is an unsupervised learning task that aims to partition data into a set of clusters. In many applications, these clusters correspond to real-world constructs (e.g., electoral districts, playlists, TV channels) whose benefit can only be attained by groups when they reach a minimum level of representation (e.g., 50\% to elect their desired candidate). In this paper, we study the k-means and k-medians clustering problems with the additional constraint that each group (e.g., demographic group) must have a minimum level of representation in at least a given number of clusters. We formulate the problem through a mixed-integer optimization framework and present an alternating minimization algorithm, called MiniReL, that directly incorporates the fairness constraints. While incorporating the fairness criteria leads to an NP-Hard assignment problem within the algorithm, we provide computational approaches that make the algorithm practical even for large datasets. Numerical results show that the approach is able to create fairer clusters with practically no increase in the clustering cost across standard benchmark datasets.<|reference_end|>
@article{lawless2024fair,
    title={Fair Minimum Representation Clustering via Integer Programming},
    author={Connor Lawless and Oktay Gunluk},
    journal={arXiv preprint arXiv:2409.02963},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.02963},
    primaryClass={math.OC cs.CY cs.LG}
}