Interpretable clustering using unsupervised binary trees

DOI10.1007/S11634-013-0129-3MaRDI QIDQ354178zbMATH OpenOpenAlexFDO

Authors Badih Ghattas, Marcela Svarc, Ricardo Fraiman

Publication date 18 July 2013

Published in Advances in Data Analysis and Classification. ADAC (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1103.5339

zbMATH Keywords

CARTpattern recognitionunsupervised classification

Mathematics Subject Classification ID

Applications of graph theory (05C90) Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Abstract: 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 descend from the same node originally. Consistency results are obtained, and the procedure is used on simulated and real data sets.

Recommendations

• A clustering approach to interpretable principal components
• Binary trees for dissimilarity data
• scientific article; zbMATH DE number 7219022
• Assessing variable importance in clustering: a new method based on unsupervised binary decision trees
• Recovering Trees with Convex Clustering

Cites work

• A review of robust clustering methods
• Cluster Identification Using Projections
• Data Clustering: Theory, Algorithms, and Applications
• scientific article; zbMATH DE number 3860199 (Why is no real title available?)
• scientific article; zbMATH DE number 3942813 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• Initializing \(K\)-means batch clustering: A critical evaluation of several techniques
• Local equivalences of distances between clusterings -- a geometric perspective
• Model-Based Clustering, Discriminant Analysis, and Density Estimation
• Optimal and fast detection of spatial clusters with scan statistics
• PROBABILISTIC DISTANCE CLUSTERING ADJUSTED FOR CLUSTER SIZE
• The Scorpio-Centaurus Cluster (the Southern Stream)

Cited in

(13)

• Assessing variable importance in clustering: a new method based on unsupervised binary decision trees
• Interpretable clustering: an optimization approach
• Clustering multivariate functional data using unsupervised binary trees
• Functional data clustering via hypothesis testing \(k\)-means
• Nearly tight bounds on the price of explainability for the \(k\)-center and the maximum-spacing clustering problems
• Interpretable taxonomy extraction from digital assets metadata using automated unsupervised decision tree learning
• Interpretable clustering via soft clustering trees
• On clustering and interpreting with rules by means of mathematical optimization
• The computational complexity of some explainable clustering problems
• How to find a good explanation for clustering?
• Robustification of the k-means clustering problem and tailored decomposition methods: when more conservative means more accurate
• Context tree classification and clustering
• A hypothesis test for comparing two partitions obtained from the same dataset

Describes a project that uses

Uses Software

• mclust
• robustbase

This page was built for publication: Interpretable clustering using unsupervised binary trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q354178)