Abstract

Clustering is an important task in mining evolving data streams. Beside the limited memory and one-pass constraints, the nature of evolving data streams implies the following requirements for stream clustering: no assumption on the number of clusters, discovery of clusters with arbitrary shape and ability to handle outliers. While a lot of clustering algorithms for data streams have been proposed, they offer no solution to the combination of these requirements. In this paper, we present DenStream, a new approach for discovering clusters in an evolving data stream. The “dense” micro-cluster (named core-micro-cluster) is introduced to summarize the clusters with arbitrary shape, while the potential core-micro-cluster and outlier micro-cluster structures are proposed to maintain and distinguish the potential clusters and outliers. A novel pruning strategy is designed based on these concepts, which guarantees the precision of the weights of the micro-clusters with limited memory. Our performance study over a number of real and synthetic data sets demonstrates the effectiveness and efficiency of our method.

Keywords

Computer scienceCluster analysisNoise (video)Data miningArtificial intelligence

Affiliated Institutions

Related Publications

Publication Info

Year
2006
Type
article
Citations
982
Access
Closed

External Links

Social Impact

Social media, news, blog, policy document mentions

Citation Metrics

982
OpenAlex

Cite This

Feng Cao, Martin Estert, Weining Qian et al. (2006). Density-Based Clustering over an Evolving Data Stream with Noise. . https://doi.org/10.1137/1.9781611972764.29

Identifiers

DOI
10.1137/1.9781611972764.29