A shrinking-clustering method for high dimensional data using flexible size grid

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

A shrinking-clustering method using flexible size grid is proposed to solve the clustering problem of high dimensional data in data mining. The data bins are arranged according to their density span, and the data points are moved along the direction of the density gradient. Thus the condensed and widely-separated clusters are generated. Then the connected components of dense cells are detected using a sequence of grids with flexible size. Finally, the best clustering result is obtained when the borderline does not change again. The simulation result shows that the method could detect clusters effectively and efficiently in both low and high dimensional data.

Original languageEnglish
Pages (from-to)716-721
Number of pages6
JournalMoshi Shibie yu Rengong Zhineng/Pattern Recognition and Artificial Intelligence
Volume20
Issue number5
StatePublished - Oct 2007

Keywords

  • Data Bin
  • Dense Span
  • Flexible Size Grid
  • Shrinking-Clustering

Fingerprint

Dive into the research topics of 'A shrinking-clustering method for high dimensional data using flexible size grid'. Together they form a unique fingerprint.

Cite this