A Kind of Data Stream Clustering Algorithm Based on Grid and Relative Density

This paper provided a Data Stream Clustering Algorithm Based on Grid and Relative Density which inherits the advantages of grid based clustering and relative density based clustering which can discover arbitrary-shape and multi-resolution clusters. Meanwhile introduced a concept of support which made algorithm adopt thoughts based on distance-based algorithm, provide the way to solve the effects of data object around grid on grid density.