Incremental Clustering: The Case for Extra Clusters
Not on the map. Why?
Abstract (arXiv)
The explosion in the amount of data available for analysis often necessitates a transition from batch to incremental clustering methods, which process one element at a time and typically store only a small subset of the data. In this paper, we initiate the formal analysis of incremental clustering methods focusing on the types of cluster structure that they are able to detect. We find that the incremental setting is strictly weaker than the batch model, proving that a fundamental class of cluster structures that can readily be detected in the batch setting is impossible to identify using any incremental method. Furthermore, we show how the limitations of incremental clustering can be overcome by allowing additional clusters.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). First posted on arXiv 24 Jun 2014.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 2; 2023: 1; 2024: 0; 2025: 2.
5 papers.
- 2022Prototypical Fine-tuning: Towards Robust Performance Under Varying Data Sizescited by 10
- 2022Graceful Forgetting II. Data as a Processcited by 1
- 2023Are Easy Data Easy (for K-Means)cited by 0
- 2025Graceful forgetting: Memory as a processcited by 0
- 2025Hierarchical Linkage Clustering Beyond Binary Trees and Ultrametricscited by 0
- 2025Hierarchical Linkage Clustering Beyond Binary Trees and Ultrametrics22 Nov 2025
- 2025Graceful forgetting: Memory as a process16 Feb 2025
- 2023Are Easy Data Easy (for K-Means)2 Aug 2023
- 2022Prototypical Fine-tuning: Towards Robust Performance Under Varying Data Sizes24 Nov 2022
- 2022Graceful Forgetting II. Data as a Process20 Nov 2022