Sub-dominant theory in numerical taxonomy
From MaRDI portal
Publication:2489653
Recommendations
Cites work
- Approximating dissimilarities by quasi-ultrametrics
- Cluster analysis and mathematical programming
- scientific article; zbMATH DE number 4098484 (Why is no real title available?)
- scientific article; zbMATH DE number 3504320 (Why is no real title available?)
- NP-hard approximation problems in overlapping clustering.
- NP-hard problems in hierarchical-tree clustering
- Sur la liaison et la division des points d'un ensemble fini
- The k-weak hierarchical representations: An extension of the indexed closed weak hierarchies
- Weak hierarchies associated with similarity measures - An additive clustering technique
Cited in
(6)- New special cases of the quadratic assignment problem with diagonally structured coefficient matrices
- Combinatorial optimisation and hierarchical classifications
- Parsimonious cluster systems
- Ultrametricity of dissimilarity spaces and its significance for data mining
- Weak Hierarchies: A Central Clustering Structure
- A new tractable case of the QAP with a Robinson matrix
This page was built for publication: Sub-dominant theory in numerical taxonomy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2489653)