AIConfPaper
← Search

Beirong Cui

2 accepted papers

2026

Linear Time Algorithms for Individually Fair k-means via Multi-Swap Local Search

Beirong Cui, Qilong Feng, Junyu Huang
AAAI 2026technical

Fair clustering has attracted increased attention in recent years. In this work, we study the individually fair clustering problem in Euclidean space. While single-swap local search methods have achieved near-linear running time and constant approximation guarantees, their performance often depends

Cited by 0Source ↗PDF ↗Scholar ↗
2025

Fast Local Search Algorithms for Clustering with Adaptive Sampling and Bandit Strategies

Junyu Huang, Qilong Feng, Zhen Zhang, Beirong Cui, Jianxin Wang
NeurIPS 2025poster

Local search is a powerful clustering technique that provides high-quality solutions with theoretical guarantees. With distance-based sampling strategies, local search methods can achieve constant approximations for clustering with linear running time in data size. Despite their effectiveness, exist…

Cited by 0Source ↗Scholar ↗