A Polynomial-Time Approximation for Pairwise Fair k-Median Clustering.
Sayan BandyapadhyayEden ChlamtácYury MakarychevAli VakilianPublished in: CoRR (2024)
Keyphrases
- pairwise
- polynomial time approximation
- spectral clustering
- clustering algorithm
- similarity function
- clustering method
- k means
- dissimilarity matrix
- np hard
- approximation algorithms
- similarity measure
- markov random field
- unsupervised learning
- error bounds
- data clustering
- hierarchical clustering
- linear programming
- similarity matrix
- semi supervised
- pairwise interactions
- active learning
- hypergraph partitioning
- spatially close