Criterion-based divisive clustering for symbolic data

From MaRDI portal





A divisive clustering method for a symbolic \(n\times p\) data array \(\underline{X}=\{Y_j(k)\}\) is proposed. In the proposed clustering method a division is defined by optimizing a suitable generalization of the classical within-clusters variance criterion to the case of symbolic data. This criterion is then minimized with respect to all the bipartitions induced by a set of binary questions relating to any of the symbolic variables \(Y_j\) with an ordered domain \({\mathcal Y}_j\) (observation space) such that the data array may contain classical, multivalent, interval or modal variables. The clusters are not systematically split, but one of the clusters is chosen according to a specific criterion. The splitting process is stopped after a number of iterations which may be specified by the user who is typically interested in a classification with a small number of clusters. The output of this divisive clustering method is an indexed hierarchy (dendrogram) which is also a decision tree. For the entire collection see [Zbl 1039.62501].











This page was built for publication: Criterion-based divisive clustering for symbolic data

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