On cluster tree for nested and multi-density data clustering

Xutao Li, Yunming Ye, Mark Junjie Li, Kwok Po NG*

*Corresponding author for this work

Research output: Contribution to journalJournal articlepeer-review

24 Citations (Scopus)


Clustering is one of the important data mining tasks. Nested clusters or clusters of multi-density are very prevalent in data sets. In this paper, we develop a hierarchical clustering approach-a cluster tree to determine such cluster structure and understand hidden information present in data sets of nested clusters or clusters of multi-density. We embed the agglomerative k-means algorithm in the generation of cluster tree to detect such clusters. Experimental results on both synthetic data sets and real data sets are presented to illustrate the effectiveness of the proposed method. Compared with some existing clustering algorithms (DBSCAN, X-means, BIRCH, CURE, NBC, OPTICS, Neural Gas, Tree-SOM, EnDBSAN and LDBSCAN), our proposed cluster tree approach performs better than these methods.

Original languageEnglish
Pages (from-to)3130-3143
Number of pages14
JournalPattern Recognition
Issue number9
Publication statusPublished - Sept 2010

Scopus Subject Areas

  • Software
  • Signal Processing
  • Computer Vision and Pattern Recognition
  • Artificial Intelligence

User-Defined Keywords

  • Cluster tree
  • Hierarchical clustering
  • K-Means-type algorithm
  • Multi-densities


Dive into the research topics of 'On cluster tree for nested and multi-density data clustering'. Together they form a unique fingerprint.

Cite this