Recursive partitioning clustering tree algorithm

Ji Hoon Kang, Chan Hee Park, Seoung Bum Kim

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

Clustering analysis elicits the natural groupings of a dataset without requiring information about the sample class and has been widely used in various fields. Although numerous clustering algorithms have been proposed and proven to perform reasonably well, no consensus exists about which one performs best in real situations. In this study, we propose a nonparametric clustering method based on recursive binary partitioning that was implemented in a classification and regression tree model. The proposed clustering algorithm has two key advantages: (1) users do not have to specify any parameters before running it; (2) the final clustering result is represented by a set of if–then rules, thereby facilitating analysis of the clustering results. Experiments with the simulations and real datasets demonstrate the effectiveness and usefulness of the proposed algorithm.

Original languageEnglish
Pages (from-to)355-367
Number of pages13
JournalPattern Analysis and Applications
Volume19
Issue number2
DOIs
Publication statusPublished - 2016 May 1

Keywords

  • Clustering algorithm
  • Recursive binary partitioning
  • Silhouette statistic
  • Unsupervised learning

ASJC Scopus subject areas

  • Artificial Intelligence
  • Computer Vision and Pattern Recognition

Fingerprint Dive into the research topics of 'Recursive partitioning clustering tree algorithm'. Together they form a unique fingerprint.

  • Cite this