Recursive partitioning clustering tree algorithm

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 perfor...

Full description

Saved in:
Bibliographic Details
Published in:Pattern analysis and applications : PAA Vol. 19; no. 2; pp. 355 - 367
Main Authors: Kang, Ji Hoon, Park, Chan Hee, Kim, Seoung Bum
Format: Journal Article
Language:English
Published: London Springer London 01.05.2016
Subjects:
Computer Science
Pattern Recognition
Theoretical Advances
Silhouette statistic
Clustering algorithm
Unsupervised learning
Recursive binary partitioning
ISSN:1433-7541, 1433-755X
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1433-7541
1433-755X
DOI:10.1007/s10044-014-0399-1