Moving Up the Cluster Tree with the Gradient Flow
From MaRDI portal
Publication:6171682
DOI10.1137/22M1469869arXiv2109.08362MaRDI QIDQ6171682FDOQ6171682
Authors: Ery Arias-Castro, Wanli Qiao 
Publication date: 14 August 2023
Published in: SIAM Journal on Mathematics of Data Science (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/2109.08362
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
- Algorithm AS 136: A K-Means Clustering Algorithm
- Title not available (Why is that?)
- Curvature Measures
- Least squares quantization in PCM
- On nonparametric estimation of density level sets
- Asymptotic normality of plug-in level set estimates
- On Grouping for Maximum Homogeneity
- Confidence regions for level sets
- Consistency of Single Linkage for High-Density Clusters
- Title not available (Why is that?)
- Optimal rates for plug-in estimators of density level sets
- Fully adaptive density-based clustering
- Multiscale inference about a density
- Fronts propagating with curvature-dependent speed: Algorithms based on Hamilton-Jacobi formulations
- The dip test of unimodality
- Granulometric smoothing
- Measuring mass concentrations and estimating density contour clusters -- An excess mass approach
- A nonparametric statistical approach to clustering via mode identification
- The estimation of the gradient of a density function, with applications in pattern recognition
- Comparison of Smoothing Parameterizations in Bivariate Kernel Density Estimation
- Generalized density clustering
- Level set methods and dynamic implicit surfaces
- Introduction to Smooth Manifolds
- Morse Theory. (AM-51)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Estimating the cluster tree of a density by analyzing the minimal spanning tree of a sample
- Title not available (Why is that?)
- Adaptive Hausdorff estimation of density level sets
- Differential equations, dynamical systems, and an introduction to chaos
- An invitation to Morse theory
- Stability of density-based clustering
- An introduction to Morse theory. Transl. from the Japanese by Kiki Hudson and Masahico Saito
- Title not available (Why is that?)
- Statistical inference using the Morse-Smale complex
- A Nonparametric Valley-Seeking Technique for Cluster Analysis
- Nonparametric testing of the existence of modes
- Single linkage clustering and continuum percolation
- Multivariate mode hunting: Data analytic tools with measures of significance
- Non-Parametric Inference for Density Modes
- Nonparametric estimation of surface integrals on level sets
- A population background for nonparametric density-based clustering
- Consistent Procedures for Cluster Tree Estimation and Pruning
- Nonparametric confidence regions for level sets: statistical properties and geometry
- A Review on Modal Clustering
- NORMAL-MAP BETWEEN NORMAL-COMPATIBLE MANIFOLDS
- A unifying view of modal clustering
- DBSCAN: optimal rates for density-based cluster estimation
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)
