Ultrametric fitting by gradient descent *
From MaRDI portal
Publication:5857451
DOI10.1088/1742-5468/abc62dOpenAlexW3114173783MaRDI QIDQ5857451
Giovanni Chierchia, Benjamin Perret
Publication date: 1 April 2021
Published in: Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1905.10566
Related Items (5)
Order preserving hierarchical agglomerative clustering ⋮ Component tree loss function: definition and optimization ⋮ 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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding the closest ultrametric
- Statistical theory in clustering
- The complexity of ultrametric partitions on graphs
- Feature relevance in Ward's hierarchical clustering using the \(L_p\) norm
- Approximate Ultrametricity for Random Measures and Applications to Spin Glasses
- Fitting Tree Metrics: Hierarchical Clustering and Phylogeny
- A method that reveals the multi-level ultrametric tree hidden in p -spin-glass-like systems
- Critical behaviour and ultrametricity of Ising spin-glass with long-range interactions
- Approximate Hierarchical Clustering via Sparsest Cut and Spreading Metrics
- The origin of the ultrametric topology of spin glasses
- Playing with Kruskal: Algorithms for Morphological Trees in Edge-Weighted Graphs
- Hierarchical Clustering better than Average-Linkage
- A cost function for similarity-based hierarchical clustering
- The Construction of Hierarchic and Non-Hierarchic Classifications
This page was built for publication: Ultrametric fitting by gradient descent *