Ultrametric fitting by gradient descent *
From MaRDI portal
Publication:5857451
Recommendations
Cites work
- A characterization of linkage-based hierarchical clustering
- A cost function for similarity-based hierarchical clustering
- A method that reveals the multi-level ultrametric tree hidden in p-spin-glass-like systems
- Approximate hierarchical clustering via sparsest cut and spreading metrics
- Approximate ultrametricity for random measures and applications to spin glasses
- Characterization, stability and convergence of hierarchical clustering methods
- Critical behaviour and ultrametricity of Ising spin-glass with long-range interactions
- Feature relevance in Ward's hierarchical clustering using the L_p norm
- Finding the closest ultrametric
- Fitting Tree Metrics: Hierarchical Clustering and Phylogeny
- Hierarchical clustering better than average-linkage
- Hierarchical clustering via spreading metrics
- Hierarchical clustering: objective functions and algorithms
- scientific article; zbMATH DE number 1512678 (Why is no real title available?)
- Playing with Kruskal: algorithms for morphological trees in edge-weighted graphs
- Statistical theory in clustering
- The complexity of ultrametric partitions on graphs
- The Construction of Hierarchic and Non-Hierarchic Classifications
- The origin of the ultrametric topology of spin glasses
Cited in
(5)- Some open questions on morphological operators and representations in the deep learning era. A personal vision
- An algebraic framework for out-of-core hierarchical segmentation algorithms
- End-to-end similarity learning and hierarchical clustering for unfixed size datasets
- Order preserving hierarchical agglomerative clustering
- Component tree loss function: definition and optimization
This page was built for publication: Ultrametric fitting by gradient descent *
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5857451)