Systems of sets such that each set properly intersects at most one other set -- application to cluster analysis

DOI10.1016/j.dam.2007.05.023zbMath1295.05247OpenAlexW2043454500MaRDI QIDQ947062

Patrice Bertrand

Publication date: 29 September 2008

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2007.05.023

zbMATH Keywords

Robinsonian dissimilarityproper intersectionagglomerative hierarchical classification (AHC)interval set systempaired hierarchy

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Extremal set theory (05D05)

Related Items

An interval convexity-based framework for multilevel clustering with applications to single-linkage clustering ⋮ On critical sets of a finite Moore family ⋮ Multilevel clustering models and interval convexities ⋮ Axiomatic characterization of transit functions of weak hierarchies

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Weak hierarchies associated with similarity measures - An additive clustering technique
• Pyramidal classification based on incomplete dissimilarity data
• NP-hard approximation problems in overlapping clustering.
• Set systems and dissimilarities
• Quasi-ultrametrics and their \(2\)-ball hypergraphs
• Hierarchical clustering schemes
• Les isomorphismes HTS et HTE. (The HTS and HTE isomorphisms)
• A New Agglomerative 2–3 Hierarchical Clustering Algorithm

This page was built for publication: Systems of sets such that each set properly intersects at most one other set -- application to cluster analysis