scientific article; zbMATH DE number 1302183

From MaRDI portal
Publication:4247450





This review on combinatorial clustering is based on types for input data and cluster structures as output. First, different types of data like column-conditional tables, comparable, aggregable, Boolean and spatial data are described. Then discrete cluster structures like single clusters, partitions and hierarchies are defined. The further sections describe clustering algorithms: among others a greedy seriation and a moving center separation algorithm for finding single clusters, partitioning algorithms (including local search and graph partitioning), an approximation algorithm for binary hierarchies, a box clustering algorithm and an aggregation method for flow tables. In connection with indexed hierarchies ultrametrics are discussed and the fitting of tree metrics is outlined. For the entire collection see [Zbl 0914.90001].











This page was built for publication:

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