A Grid and Density-based Clustering Algorithm for Processing Data Stream

This paper proposes DD-Stream, a framework for density-based clustering stream data. The algorithm adopts a density decaying technique to capture the evolving data stream and extracts the boundary point of grid by the DCQ-means algorithm. Our method resolving the problem of evolving automatic clustering of real-time data streams, can not only find arbitrary shaped clusters with noise, but also avoid the clustering quality problems caused by discarding the boundary point of grid, our algorithm has better scalability in processing large-scale and high-dimensional stream data as well.