Clustering using Unsupervised Binary Trees: CUBT

Details Clustering using Unsupervised Binary Trees: CUBT Clustering using Unsupervised Binary Trees: CUBT

2010-11-11

arxiv.org/abs/1011.2624v2

Statistics

Methodology

This paper has been withdrawn by the author due to an involuntary double submission to the arxiv

Scientific paper

We herein introduce a new method of interpretable clustering that uses unsupervised binary trees. It is a three-stage procedure, the first stage of which entails a series of recursive binary splits to reduce the heterogeneity of the data within the new subsamples. During the second stage (pruning), consideration is given to whether adjacent nodes can be aggregated. Finally, during the third stage (joining), similar clusters are joined together, even if they do not share the same parent originally. Consistency results are obtained, and the procedure is used on simulated and real data sets.

Affiliated with

Also associated with

No associations

Rating

Clustering using Unsupervised Binary Trees: CUBT does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Clustering using Unsupervised Binary Trees: CUBT, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Clustering using Unsupervised Binary Trees: CUBT will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-430841