Transit functions and clustering systems
From MaRDI portal
Cites work
- A New Agglomerative 2–3 Hierarchical Clustering Algorithm
- A structure theorem for the consecutive 1's property
- 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
- Combinatorial optimization and hierarchical classifications
- Community structure in social and biological networks
- Cut vertex transit functions of hypergraphs
- Faithful Representation of a Family of Sets by a Set of Intervals
- scientific article; zbMATH DE number 3889566 (Why is no real title available?)
- scientific article; zbMATH DE number 3504320 (Why is no real title available?)
- scientific article; zbMATH DE number 3641484 (Why is no real title available?)
- scientific article; zbMATH DE number 892273 (Why is no real title available?)
- scientific article; zbMATH DE number 5499517 (Why is no real title available?)
- Multilevel clustering models and interval convexities
- On a certain numbering of the vertices of a hypergraph
- Systems of sets such that each set properly intersects at most one other set -- application to cluster analysis
- Weak hierarchies associated with similarity measures - An additive clustering technique
This page was built for publication: Transit functions and clustering systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6995328)