Transit functions and pyramid-like binary clustering systems

DOI10.1016/J.DAM.2024.06.032MaRDI QIDQ6611037zbMATH OpenFDO

Authors Manoj Changat, Ameera Vaheeda Shanavas, Peter F. Stadler

Publication date 26 September 2024

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

Full work available at URL https://doi.org/10.1016/J.DAM.2024.06.032

zbMATH Keywords

interval hypergraphmonotone transit functionstotally balanced hypergraphunion-closureweak hierarchy

Mathematics Subject Classification ID

Connectivity (05C40) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Axiomatic characterization of transit functions of weak hierarchies
• Axiomatic characterization of transit functions of hierarchies
• Beyond the Pyramids: Rigid Clustering Systems
• Binary clustering

Cites work

• A characterization of totally balanced hypergraphs
• A structure theorem for the consecutive 1's property
• An interval convexity-based framework for multilevel clustering with applications to single-linkage clustering
• Axiomatic characterization of transit functions of hierarchies
• Axiomatic characterization of transit functions of weak hierarchies
• Binary clustering
• Characterization problems for graphs, partially ordered sets, lattices, and families of sets
• Crown-free lattices and their related graphs
• Cut vertex transit functions of hypergraphs
• Degrees of acyclicity for hypergraphs and relational database schemes
• From hypertrees to arboreal quasi-ultrametrics
• scientific article; zbMATH DE number 439012 (Why is no real title available?)
• scientific article; zbMATH DE number 3889566 (Why is no real title available?)
• scientific article; zbMATH DE number 3487492 (Why is no real title available?)
• scientific article; zbMATH DE number 3641484 (Why is no real title available?)
• scientific article; zbMATH DE number 5499517 (Why is no real title available?)
• Hypergraphs with no special cycles
• Multilevel clustering models and interval convexities
• On a certain numbering of the vertices of a hypergraph
• On the Desirability of Acyclic Database Schemes
• On the existence of acyclic views in a database scheme
• Recognizing different types of beta-cycles in a database scheme
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Some characterizations of \(\gamma \) and \(\beta \)-acyclicity of hypergraphs
• Systems of sets such that each set properly intersects at most one other set -- application to cluster analysis
• Totally balanced dissimilarities
• Weak hierarchies associated with similarity measures - An additive clustering technique

Cited in

(2)

• On the cut-vertex and the interval transit functions of hypergraphs
• Corrigendum to: ``Transit functions and pyramid-like binary clustering systems

This page was built for publication: Transit functions and pyramid-like binary clustering systems

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