Combinatorial optimisation and hierarchical classifications
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3889566 (Why is no real title available?)
- scientific article; zbMATH DE number 3856225 (Why is no real title available?)
- scientific article; zbMATH DE number 3898256 (Why is no real title available?)
- scientific article; zbMATH DE number 3951816 (Why is no real title available?)
- scientific article; zbMATH DE number 3951818 (Why is no real title available?)
- scientific article; zbMATH DE number 4098484 (Why is no real title available?)
- scientific article; zbMATH DE number 3747198 (Why is no real title available?)
- scientific article; zbMATH DE number 3466361 (Why is no real title available?)
- scientific article; zbMATH DE number 3504320 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 3573250 (Why is no real title available?)
- scientific article; zbMATH DE number 3579840 (Why is no real title available?)
- scientific article; zbMATH DE number 3617544 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 736965 (Why is no real title available?)
- scientific article; zbMATH DE number 1129257 (Why is no real title available?)
- scientific article; zbMATH DE number 3448387 (Why is no real title available?)
- scientific article; zbMATH DE number 3204690 (Why is no real title available?)
- scientific article; zbMATH DE number 3186403 (Why is no real title available?)
- A note on two problems in connexion with graphs
- An Order Theoretic Model for Cluster Analysis
- An order theoretic framework for overlapping clustering
- Approximating dissimilarities by quasi-ultrametrics
- Binary clustering
- Circular representation problem on hypergraphs
- Classification and dissimilarity analysis
- Cluster analysis and mathematical programming
- Combinatorial optimization and hierarchical classifications
- Construction de l'ultramétrique la plus proche d'une dissimilarité au sens des moindres carrés
- Continuous L-cluster methods
- From hypertrees to arboreal quasi-ultrametrics
- Graph-theoretic representations for proximity matrices through strongly-anti-Robinson or circular strongly-anti-Robinson matrices
- Hierarchical clustering schemes
- Hypergraphes arbores
- Les isomorphismes HTS et HTE. (The HTS and HTE isomorphisms)
- Linear and circular unidimensional scaling for symmetric proximity matrices
- Monotone Equivariant Cluster Methods
- NP-hard approximation problems in overlapping clustering.
- NP-hard problems in hierarchical-tree clustering
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Recognition of Robinsonian dissimilarities
- Set systems and dissimilarities
- Some observations on a paper by Lance and Williams
- Space-conserving agglomerative algorithms
- Spatial, non-spatial and hybrid models for scaling
- Sub-dominant theory in numerical taxonomy
- Sur la liaison et la division des points d'un ensemble fini
- Symmetric binary B-trees: Data structure and maintenance algorithms
- The \(k\)-weak hierarchical representations: An extension of the indexed closed weak hierarchies
- The structure and construction of taxonomic hierarchies
- Tree structures for proximity data
- Weak hierarchies associated with similarity measures - An additive clustering technique
- \(l_\infty\)-approximation via subdominants.
Cited in
(4)
This page was built for publication: Combinatorial optimisation and hierarchical classifications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2480261)
