Constructing hierarchical set systems

DOI10.1007/S00026-004-0231-5MaRDI QIDQ1764476zbMATH OpenOpenAlexWikidataFDO

Authors Claudine Devauchelle, Andreas W. M. Dress, Alexander Grossmann, Stefan Grünewald, Alain Hénaut

Publication date 25 February 2005

Published in Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00026-004-0231-5

zbMATH Keywords

diversity optimizationFarris transformhierarchiesranking procedureranking statisticsset systems

Mathematics Subject Classification ID

Applications of graph theory (05C90) Order statistics; empirical distribution functions (62G30) Taxonomy, cladistics, statistics in mathematical biology (92B10) Problems related to evolution (92D15)

Review text

This paper introduces a new algorithm to achieve data clusters. The procedure works with dissimilarity data. It starts with the so-called Apresjan hierarchy and while the needed calculations are easy and fast, the resulting nested clusters give a very good understanding of the data.

Recommendations

• scientific article; zbMATH DE number 894865
• Hierarchical clustering algorithms for repetitive similarity values
• Classic: A hierarchical clustering algorithm based on asymmetric similarities
• scientific article; zbMATH DE number 475225
• Hierarchical clustering schemes

Cited in

(7)

• Hierarchical sets in mathematical programming modeling languages
• Finding natural cluster hierarchies based on multifractal
• What is a Higher-Level Set?
• Split decomposition over an Abelian group. I: Generalities
• Pseudo-rate matrices, beyond Dayhoff's model
• Shared farthest neighbor approach to clustering of high dimensionality, low cardinality data
• Systems of sets such that each set properly intersects at most one other set -- application to cluster analysis

This page was built for publication: Constructing hierarchical set systems

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