Copyright © 2007 Elsevier B.V. All rights reserved.
DIVCLUS-T: A monothetic divisive hierarchical clustering method
Available online 18 March 2007.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
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, unlike Ward 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.
Keywords: Divisive clustering; Monothetic cluster; Decision dendrogram; Inertia criterion
Article Outline
- 1. Introduction
- 2. An example
- 3. The data table
- 4. The inertia criterion
- 5. DIVCLUS-T
- 5.1. The problem of how to split a cluster
- 5.1.1. Inertia of a bipartition
- 5.1.2. Binary questions
- 5.1.3. Choice of the binary question
- 5.2. Selecting the cluster to be split
- 5.3. An example for categorical data
- 5.4. Computational complexity
- 6. Empirical comparison with Ward and k-means
- 7. Conclusion
- References







E-mail Article
Add to my Quick Links

Cited By in Scopus (0)






