“Stable Clusters”: a new Approach for Clustering Binary Variables

As pointed out by Openshaw (1980), monothetic divisive algorithms often need for some means of post-classification relocation. We introduce a new criterion for improving the results of a (particular) monothetic divisive algorithm for clustering individuals classified on the basis of Q binary variables. This is done by referring to an agglomerative algorithm having very interesting similarities with the monothetic divisive algorithm taken into account. The new algorithm, developed by combining information arising from the two procedures, is compared with a relocation algorithm proposed by Openshaw.