DIVCLUS-T: a monothetic divisive hierarchical clustering method
CHAVENT, Marie
Institut de Mathématiques de Bordeaux [IMB]
Quality control and dynamic reliability [CQFD]
Institut de Mathématiques de Bordeaux [IMB]
Quality control and dynamic reliability [CQFD]
CHAVENT, Marie
Institut de Mathématiques de Bordeaux [IMB]
Quality control and dynamic reliability [CQFD]
< Réduire
Institut de Mathématiques de Bordeaux [IMB]
Quality control and dynamic reliability [CQFD]
Langue
en
Article de revue
Ce document a été publié dans
Computational Statistics and Data Analysis. 2007, vol. 52, n° 2, p. 687-701
Elsevier
Résumé en anglais
DIVCLUS-T is a divisive hierarchical clustering algorithm based on a monothetic bipartitional approach allowing the dendrogram of the hierarchy to be read as a decision tree. It is designed for either numerical or categorical ...Lire la suite >
DIVCLUS-T is a divisive hierarchical clustering algorithm based on a monothetic bipartitional approach allowing the dendrogram of the hierarchy to be read as a decision tree. It is designed for either numerical or categorical data. Like the Ward agglomerative hierarchical clustering algorithm and the k-means partitioning algorithm, it is based on the minimization of the inertia criterion. However, unlikeWard and k-means, it provides a simple and natural interpretation of the clusters. The price paid by construction in terms of inertia by DIVCLUS-T for this additional interpretation is studied by applying the three algorithms on six databases from the UCI Machine Learning repository.< Réduire
Mots clés en anglais
Divisive clustering
Monothetic cluster
Decision dendrogram
Inertia criterion
Origine
Importé de halUnités de recherche