Bi-criteria sublinear time algorithms for clustering with outliers in high dimensions

•Research highlight 1 This paper introduces a novel uniform sampling framework for solving k-means/ median clustering with outliers problems. The key theoretical innovation lies in the sample complexity being independent of both input size and dimensionality, making it particularly effective for lar...

Full description

Bibliographic Details

Published in:	Theoretical computer science Vol. 1057; p. 115538
Main Authors:	Huang, Jiawei, Liu, Wenjie, Ding, Hu
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 06.12.2025
Subjects:	Approximation algorithm Clustering Outliers Sampling Sublinear Outliers Clustering Sampling Approximation algorithm Sublinear
ISSN:	0304-3975
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!