Document Type

Journal Article

Department/Unit

Department of Mathematics

Title

On cluster tree for nested and multi-density data clustering

Language

English

Abstract

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. © 2010 Elsevier Ltd. All rights reserved.

Keywords

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

Publication Date

2010

Source Publication Title

Pattern Recognition

Volume

43

Issue

9

Start Page

3130

End Page

3143

Publisher

Elsevier

DOI

10.1016/j.patcog.2010.03.020

ISSN (print)

00313203

This document is currently not available here.

Share

COinS