Clustering Stream Data by Exploring the Evolution of Density Mountain
Not on the map. Why?
Abstract (arXiv)
Stream clustering is a fundamental problem in many streaming data analysis applications. Comparing to classical batch-mode clustering, there are two key challenges in stream clustering: (i) Given that input data are changing continuously, how to incrementally update clustering results efficiently? (ii) Given that clusters continuously evolve with the evolution of data, how to capture the cluster evolution activities? Unfortunately, most of existing stream clustering algorithms can neither update the cluster result in real time nor track the evolution of clusters. In this paper, we propose an stream clustering algorithm EDMStream by exploring the Evolution of Density Mountain. The density mountain is used to abstract the data distribution, the changes of which indicate data distribution evolution. We track the evolution of clusters by monitoring the changes of density mountains. We further provide efficient data structures and filtering schemes to ensure the update of density mountains in real time, which makes online clustering possible. The experimental results on synthetic and real datasets show that, comparing to the state-of-the-art stream clustering algorithms, e.g., D-Stream, DenStream, DBSTREAM and MR-Stream, our algorithm can response to a cluster update much faster (say 7-15x faster than the best of the competitors) and at the same time achieve comparable cluster quality. Furthermore, EDMStream can successfully capture the cluster evolution activities.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). First posted on arXiv 2 Oct 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 2; 2023: 2; 2024: 0; 2025: 0; 2026: 1.
6 papers.
- 2022Automated Algorithm Selection: from Feature-Based to Feature-Free Approachescited by 13
- 2023Fast and Multi-aspect Mining of Complex Time-stamped Event Streamscited by 7
- 2023PECANN: Parallel Efficient Clustering with Graph-Based Approximate Nearest Neighbor Searchcited by 3
- 2021Modeling Fuzzy Cluster Transitions for Topic Tracingcited by 0
- 2022Learn to Explore: on Bootstrapping Interactive Data Exploration with Meta-learningcited by 0
- 2026Learning-Augmented Algorithms for k-median via Online Learningcited by 0
- 2026Learning-Augmented Algorithms for k-median via Online Learning18 Mar 2026
- 2023PECANN: Parallel Efficient Clustering with Graph-Based Approximate Nearest Neighbor Search6 Dec 2023
- 2023Fast and Multi-aspect Mining of Complex Time-stamped Event Streams7 Mar 2023
- 2022Learn to Explore: on Bootstrapping Interactive Data Exploration with Meta-learning7 Dec 2022
- 2022Automated Algorithm Selection: from Feature-Based to Feature-Free Approaches24 Mar 2022
- 2021Modeling Fuzzy Cluster Transitions for Topic Tracing16 Apr 2021