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...

Celý popis

Podrobná bibliografia

Vydané v:	Theoretical computer science Ročník 1057; s. 115538
Hlavní autori:	Huang, Jiawei, Liu, Wenjie, Ding, Hu
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 06.12.2025
Predmet:	Approximation algorithm Clustering Outliers Sampling Sublinear Outliers Clustering Sampling Approximation algorithm Sublinear
ISSN:	0304-3975
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!