Constructing optimal ultrametrics
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3168330 (Why is no real title available?)
- scientific article; zbMATH DE number 3942813 (Why is no real title available?)
- scientific article; zbMATH DE number 3469876 (Why is no real title available?)
- scientific article; zbMATH DE number 3504320 (Why is no real title available?)
- scientific article; zbMATH DE number 3800811 (Why is no real title available?)
- A Monte Carlo study of thirty internal criterion measures for cluster analysis
- A Review of Hierarchical Classification
- A new approach to isotonic agglomerative hierarchical clustering
- Clique optimization: A method to construct parsimonious ultrametric trees from similarity data
- Hierarchical clustering schemes
- Maximum sum-of-splits clustering
- Measures of Association for Cross Classifications
- NP-hard problems in hierarchical-tree clustering
- On Some Clustering Techniques
- Random Graphs
- Restart procedures for the conjugate gradient method
- Some applications of graph theory to clustering
- Ultrametric hierarchical clustering algorithms
- Validity studies in clustering methodologies
This page was built for publication: Constructing optimal ultrametrics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1314829)