Interpretable clustering using unsupervised binary trees

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.

[1]  G. Walther.  Optimal and fast detection of spatial clusters with scan statistics , 2010, 1002.4770.

[2]  R. Tryon.  Cluster Analysis , 1939 .

[3]  Christiane Guinot,et al.  Méthodes divisives de classification et segmentation non supervisée : recherche d'une typologie de la peau humaine saine , 1999 .

[4]  Marina Meila,et al.  Local equivalences of distances between clusterings—a geometric perspective , 2012, Machine Learning.

[5]  Adrian E. Raftery,et al.  MCLUST Version 3 for R: Normal Mixture Modeling and Model-Based Clustering † , 2007 .

[6]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[7]  Danny Coomans,et al.  Auto-associative Multivariate Regression Trees for Cluster Analysis , 2006 .

[8]  Trevor Hastie,et al.  The Elements of Statistical Learning , 2001 .

[9]  Luc De Raedt,et al.  Top-Down Induction of Clustering Trees , 1998, ICML.

[10]  William M. Rand,et al.  Objective Criteria for the Evaluation of Clustering Methods , 1971 .

[11]  A. Raftery,et al.  Model-Based Clustering With Dissimilarities: A Bayesian Approach , 2007 .

[12]  Francisco J. Prieto,et al.  A Projection Method for Robust Estimation and Clustering in Large Data Sets , 2006 .

[13]  R. Gnanadesikan,et al.  Better alternatives to current methods of scaling and weighting data for cluster analysis , 2007 .

[14]  Danny Coomans,et al.  Clustering noisy data in a reduced dimension space via multivariate regression trees , 2006, Pattern Recognit..

[15]  F. Prieto,et al.  Cluster Identification Using Projections , 2001 .

[16]  Patrick J. F. Groenen,et al.  Data Analysis, Classification and the Forward Search , 2006 .

[17]  Jianhong Wu,et al.  Data clustering - theory, algorithms, and applications , 2007 .

[18]  Michael J. Brusco,et al.  Initializing K-means Batch Clustering: A Critical Evaluation of Several Techniques , 2007, J. Classif..

[19]  Jayanta Basak,et al.  Interpretable hierarchical clustering by constructing an unsupervised decision tree , 2005, IEEE Transactions on Knowledge and Data Engineering.

[20]  Leo Breiman,et al.  Classification and Regression Trees , 1984 .

[21]  Philip S. Yu,et al.  Clustering through decision tree construction , 2000, CIKM '00.

[22]  Luis Angel García-Escudero,et al.  A review of robust clustering methods , 2010, Adv. Data Anal. Classif..

[23]  Adrian E. Raftery,et al.  Model-Based Clustering, Discriminant Analysis, and Density Estimation , 2002 .

[24]  R. Put,et al.  The use of CART and multivariate regression trees for supervised and unsupervised feature selection , 2005 .

[25]  Xiaogang Wang,et al.  Hierarchical Density-Based Clustering of Categorical Data and a Simplification , 2007, PAKDD.

[26]  Wei-Yin Loh,et al.  Classification and regression trees , 2011, WIREs Data Mining Knowl. Discov..

[27]  V. Yohai,et al.  Robust Statistics: Theory and Methods , 2006 .

[28]  Hans-Peter Kriegel,et al.  A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise , 1996, KDD.

[29]  Adi Ben-Israel,et al.  PROBABILISTIC DISTANCE CLUSTERING ADJUSTED FOR CLUSTER SIZE , 2008, Probability in the Engineering and Informational Sciences.