Fairness, Semi-Supervised Learning, and More: A General Framework for Clustering with Stochastic Pairwise Constraints

Metric clustering is fundamental in areas ranging from Combinatorial Optimization and Data Mining, to Machine Learning and Operations Research. However, in a variety of situations we may have additional requirements or knowledge, distinct from the underlying metric, regarding which pairs of points should be clustered together. To capture and analyze such scenarios, we introduce a novel family of stochastic pairwise constraints, which we incorporate into several essential clustering objectives (radius/median/means). Moreover, we demonstrate that these constraints can succinctly model an intriguing collection of applications, including among others Individual Fairness in clustering and Must-link constraints in semi-supervised learning. Our main result consists of a general framework that yields approximation algorithms with provable guarantees for important clustering objectives, while at the same time producing solutions that respect the stochastic pairwise constraints. Furthermore, for certain objectives we devise improved results in the case of Must-link constraints, which are also the best possible from a theoretical perspective. Finally, we present experimental evidence that validates the effectiveness of our algorithms. C 2 is a set of pairs of points from C, and a sequence ψ = (ψ 1 , ψ 2 , . . .) with ψ q ∈ [0, 1]. We then want j,j ′ ∈Pq Pr φ∼D [φ(j) = φ(j ′ )] ≤ ψ q |P q |, ∀P q ∈ P. • Centroid Constraint (CC): When this is imposed on any of our problems, we must first have C = F . In addition, we should ensure that Pr φ∼D [φ(i) = i] = 1 for all i ∈ S. Special Cases of SPC: When each P q ∈ P has |P q | = 1, we get two interesting resulting variants.