Is Simple Uniform Sampling Effective for Center-Based Clustering with Outliers: When and Why?
Not on the map. Why?
Abstract (arXiv)
Real-world datasets often contain outliers, and the presence of outliers can make the clustering problems to be much more challenging. In this paper, we propose a simple uniform sampling framework for solving three representative center-based clustering with outliers problems: k-center/median/means clustering with outliers. Our analysis is fundamentally different from the previous (uniform and non-uniform) sampling based ideas. To explain the effectiveness of uniform sampling in theory, we introduce a measure of "significance" and prove that the performance of our framework depends on the significance degree of the given instance. In particular, the sample size can be independent of the input data size n and the dimensionality d, if we assume the given instance is "significant", which is in fact a fairly reasonable assumption in practice. Due to its simplicity, the uniform sampling approach also enjoys several significant advantages over the non-uniform sampling approaches in practice. To the best of our knowledge, this is the first work that systematically studies the effectiveness of uniform sampling from both theoretical and experimental aspects.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 10 of its 55 references that are in the map. First posted on arXiv 28 Feb 2021.
Builds on
10 of 55 references.
References · 10
- 2019Selection via Proxy: Efficient Data Selection for Deep Learningcited by 337
- 2017Constant Approximation for k-Median and k-Means with Outliers via Iterative Roundingcited by 25
- 2018varepsilon-Coresets for Clustering (with Outliers) in Doubling Metricscited by 19
- 2018Clustering with Outlier Removalcited by 10
- 2017Approximation Schemes for Clustering with Outlierscited by 9
- 2016The Non-Uniform k-Center Problemcited by 8
- 2018Solving k-center Clustering (with Outliers) in MapReduce and Streaming, almost as Accurately as Sequentiallycited by 8
- 2018A Practical Algorithm for Distributed Clustering and Outlier Detectioncited by 7
- 2020Fast Noise Removal for k-Means Clusteringcited by 5
- 2020Layered Sampling for Robust Optimization Problemscited by 3
Built on by
Citing papers per year: 2023: 1.
1 paper.