2007•Unpublished venueRequires access

Grid-based Data Stream Clustering Algorithm

Qing Liu

Open publisher page 1 citations

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Computer science, Cluster analysis, Data stream clustering, Grid, Data mining, Noise (video), Algorithm, Data stream

Related papers

Back to paper searchBrowse research topicsOriginal source
Grid-based Data Stream Clustering Algorithm — Research Paper | ScholarLens