DIVCLUS-T: a monothetic divisive hierarchical clustering method. 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 for this software
References in zbMATH (referenced in 5 articles , 1 standard article )
Showing results 1 to 5 of 5.
- Kim, Jaejik; Billard, L.: A polythetic clustering process and cluster validity indexes for histogram-valued objects (2011)
- Wu, Han-Ming; Tien, Yin-Jing; Chen, Chun-Houh: GAP: a graphical environment for matrix visualization and cluster analysis (2010)
- Chavent, Marie; Lechevallier, Yves; Vernier, Françoise; Petit, Kevin: Monothetic divisive clustering with geographical constraints (2008)
- Chavent, Marie; Lechevallier, Yves; Briant, Olivier: DIVCLUS-T: a monothetic divisive hierarchical clustering method (2007)
- Gatu, Cristian; Gentle, James; Hinde, John; Huh, Moon: Special issue on statistical algorithms and software (2007)