Totally balanced dissimilarities

DOI10.1007/s00357-019-09320-wOpenAlexW2926242388WikidataQ128124829 ScholiaQ128124829MaRDI QIDQ779024

Célia Châtel, Pascal Préa, François Brucker

Publication date: 21 July 2020

Published in: Journal of Classification (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00357-019-09320-w

zbMATH Keywords

binary matricesdissimilaritiestotally balanced hypergraphs

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Cites Work

• Unnamed Item
• Parsimonious cluster systems
• Hypergraphs with no special cycles
• Crown-free lattices and their related graphs
• On rigid circuit graphs
• Binary clustering
• Characterizations of strongly chordal graphs
• A characterization of totally balanced hypergraphs
• Weak hierarchies associated with similarity measures - An additive clustering technique
• Efficient graph representations
• Set systems and dissimilarities
• From hypertrees to arboreal quasi-ultrametrics
• Doubly lexical ordering of dense 0--1 matrices
• Characterizations of totally balanced matrices
• Doubly Lexical Orderings of Matrices
• Totally Balanced Formal Context Representation
• Weak Hierarchies: A Central Clustering Structure

This page was built for publication: Totally balanced dissimilarities