Totally balanced dissimilarities

DOI10.1007/S00357-019-09320-WMaRDI QIDQ779024zbMATH OpenOpenAlexWikidataFDO

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

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

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

Cited in

(1)

• Transit functions and pyramid-like binary clustering systems

This page was built for publication: Totally balanced dissimilarities

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