Moving Up the Cluster Tree with the Gradient Flow
From MaRDI portal
Publication:6171682
Abstract: The paper establishes a strong correspondence between two important clustering approaches that emerged in the 1970's: clustering by level sets or cluster tree as proposed by Hartigan and clustering by gradient lines or gradient flow as proposed by Fukunaga and Hostetler. We do so by showing that we can move up the cluster tree by following the gradient ascent flow.
Recommendations
- scientific article; zbMATH DE number 5360747
- The lattice gradient flow at tree-level and its improvement
- Multiple graphs clustering by gradient flow method
- Hierarchical clustering with optimal transport
- Recovering Trees with Convex Clustering
- The Complete Gradient Clustering Algorithm: properties in practical applications
- Gradual model generator for single-pass clustering
- Agglomerative clustering via maximum incremental path integral
Cites work
- scientific article; zbMATH DE number 3181355 (Why is no real title available?)
- scientific article; zbMATH DE number 53382 (Why is no real title available?)
- scientific article; zbMATH DE number 3579840 (Why is no real title available?)
- scientific article; zbMATH DE number 1349965 (Why is no real title available?)
- scientific article; zbMATH DE number 6193688 (Why is no real title available?)
- scientific article; zbMATH DE number 3340881 (Why is no real title available?)
- A Nonparametric Valley-Seeking Technique for Cluster Analysis
- A Review on Modal Clustering
- A nonparametric statistical approach to clustering via mode identification
- A population background for nonparametric density-based clustering
- A unifying view of modal clustering
- Adaptive Hausdorff estimation of density level sets
- Algorithm AS 136: A K-Means Clustering Algorithm
- An introduction to Morse theory. Transl. from the Japanese by Kiki Hudson and Masahico Saito
- An invitation to Morse theory
- Asymptotic normality of plug-in level set estimates
- Comparison of Smoothing Parameterizations in Bivariate Kernel Density Estimation
- Confidence regions for level sets
- Consistency of Single Linkage for High-Density Clusters
- Consistent Procedures for Cluster Tree Estimation and Pruning
- Curvature Measures
- DBSCAN: optimal rates for density-based cluster estimation
- Differential equations, dynamical systems, and an introduction to chaos
- Estimating the cluster tree of a density by analyzing the minimal spanning tree of a sample
- Fronts propagating with curvature-dependent speed: Algorithms based on Hamilton-Jacobi formulations
- Fully adaptive density-based clustering
- Generalized density clustering
- Granulometric smoothing
- Introduction to Smooth Manifolds
- Least squares quantization in PCM
- Level set methods and dynamic implicit surfaces
- Measuring mass concentrations and estimating density contour clusters -- An excess mass approach
- Morse Theory. (AM-51)
- Multiscale inference about a density
- Multivariate mode hunting: Data analytic tools with measures of significance
- NORMAL-MAP BETWEEN NORMAL-COMPATIBLE MANIFOLDS
- Non-parametric inference for density modes
- Nonparametric confidence regions for level sets: statistical properties and geometry
- Nonparametric estimation of surface integrals on level sets
- Nonparametric testing of the existence of modes
- On Grouping for Maximum Homogeneity
- On nonparametric estimation of density level sets
- Optimal rates for plug-in estimators of density level sets
- Single linkage clustering and continuum percolation
- Stability of density-based clustering
- Statistical inference using the Morse-Smale complex
- The dip test of unimodality
- The estimation of the gradient of a density function, with applications in pattern recognition
This page was built for publication: Moving Up the Cluster Tree with the Gradient Flow
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6171682)
