2010•Journal of Zhengzhou University of Light IndustryRequires access

Data stream clustering algorithm based on grid and density

Ying Hu

Open publisher page 0 citations

Abstract

According to the characteristics of the data stream,a new clustering algorithm GTCS which combined the approach based on density and grid was presented.By means of the model of double-layer construction,the method set the key of densities of the data grids automatically in online layer.The offline layer using the data gravity for the center,a maximum of subgrid is built.It makes the dense regions of the candidate grids into dense grid.It uses the minimum spanning tree clustering algorithm to get the clustering results and improve the clustering affect.

About this research paper

What this paper is about

According to the characteristics of the data stream,a new clustering algorithm GTCS which combined the approach based on density and grid was presented.By means of the model of double-layer construction,the method set the key of densities of the data grids automatically in online layer.The offline layer using the data gravity for the center,a maximum of subgrid is built.It makes the dense regions of the candidate grids into dense grid.It uses the minimum spanning tree clustering algorithm to get the clustering results and improve the clustering affect.

Why it matters

A significance statement is not available in the OpenAlex record.

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

According to the characteristics of the data stream,a new clustering algorithm GTCS which combined the approach based on density and grid was presented.By means of the model of double-layer construction,the method set the key of densities of the data grids automatically in online layer.The offline layer using the data gravity for the center,a maximum of subgrid is built.It makes the dense regions of the candidate grids into dense grid.It uses the minimum spanning tree clustering algorithm to get the clustering results and improve the clustering affect.

Key concepts: Cluster analysis, Computer science, Data stream clustering, CURE data clustering algorithm, Grid, Algorithm, Correlation clustering, Determining the number of clusters in a data set

Related papers

Back to paper searchBrowse research topicsOriginal source
Data stream clustering algorithm based on grid and density — Research Paper | ScholarLens