Grid-partition Clustering Algorithm Based on Hilbert Curve
Hilbert curve can fill the data space linearly,divide it into equal-size grids and map points lying in grids into the linear space.Using the quality of the clustering of Hilbert curve,the paper presents a grid-partition clustering algorithm based on Hilbert curve.First,the algorithm merges numerous small clusters based on the grids.Then it merges the clusters again and again.Finally,it gets large clusters.According to the test,the algorithm is better than the clustering algorithm k-means and CLIQUE.