Abstract: Based on the analysis of grid-based clustering algorithms, we propose a subspace clustering algorithm that can find clusters in different subspaces for high-dimensional data streams. The algorithm combines the advantages of bottom-up grid-based method and

Key words: Grid, Subspace clustering, Data stream, High-dimensional data