Hierarchical clustering: objective functions and algorithms
From MaRDI portal
Publication:4607904
Recommendations
Cited in
(18)- Hierarchical clustering with topology databases
- Wide gaps and Kleinberg's clustering axioms for \(k\)-means
- End-to-end similarity learning and hierarchical clustering for unfixed size datasets
- Hierarchical clustering via spreading metrics
- Approximate hierarchical clustering via sparsest cut and spreading metrics
- scientific article; zbMATH DE number 7561682 (Why is no real title available?)
- A comprehensive study of clustering a class of 2D shapes
- Ultrametric fitting by gradient descent *
- Optimal hierarchical clustering on a graph
- Tangles and Hierarchical Clustering
- Expanding the class of global objective functions for dissimilarity-based hierarchical clustering
- Aggregation of Markov flows I: theory
- An improved cost function for hierarchical cluster trees
- Hierarchical clustering better than average-linkage
- Hierarchical clustering. Objective functions and algorithms
- Algorithm of Hierarchical Matrix Clusterization and Its Applications
- A flexible ILP formulation for hierarchical clustering
- A cost function for similarity-based hierarchical clustering
This page was built for publication: Hierarchical clustering: objective functions and algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4607904)