Grid-based Data Stream Clustering Algorithm
Qing Liu
Abstract
Qing Liu
Abstract
With strong ability for discovering arbitrary shape clusters and handling noise, grid-based data stream clustering algorithm efficiently resolves these problem of being very sensitive to the user-defined parameters and difficult to distinguish the density distinction of clusters.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
With strong ability for discovering arbitrary shape clusters and handling noise, grid-based data stream clustering algorithm efficiently resolves these problem of being very sensitive to the user-defined parameters and difficult to distinguish the density distinction of clusters.
Key concepts: Computer science, Cluster analysis, Data stream clustering, Grid, Data mining, Noise (video), Algorithm, Data stream