Estimating the cluster tree of a density by analyzing the minimal spanning tree of a sample
From MaRDI portal
(Redirected from Publication:1762813)
Recommendations
- A clustering procedure based on the comparison between the \(k\) nearest neighbors graph and the minimal spanning tree.
- On a minimal spanning tree approach in the cluster validation problem
- Cluster analysis: a further approach based on density estimation.
- A minimal spanning tree algorithm applied to spatial cluster analysis
- Adaptive clustering algorithm based on minimal spanning tree cutting
Cited in
(46)- A clustering procedure based on the comparison between the \(k\) nearest neighbors graph and the minimal spanning tree.
- Identifying connected components in Gaussian finite mixture models for clustering
- A population background for nonparametric density-based clustering
- Density-based silhouette diagnostics for clustering methods
- Data-driven density derivative estimation, with applications to nonparametric clustering and bump hunting
- Mixture model modal clustering
- Modal clustering using semiparametric mixtures and mode flattening
- Better than the best? Answers via model ensemble in density-based clustering
- Modal clustering asymptotics with applications to bandwidth selection
- A new mixture model on the simplex
- The blind men and the elephant: on meeting the problem of multiple truths in data from clustering and pattern mining perspectives
- Generalized cluster trees and singular measures
- Asymptotic normality of plug-in level set estimates
- Estimation of level set trees using adaptive partitions
- A statistical model of cluster stability
- A framework for semi-supervised and unsupervised optimal extraction of clusters from hierarchies
- Visualizing high density clusters in multidimensional data using optimized star coordinates
- TOBAE: a density-based agglomerative clustering algorithm
- A minimal spanning tree algorithm applied to spatial cluster analysis
- A Clustering Method for Categorical Ordinal Data
- Divisive clustering of high dimensional data streams
- Density-equalizing Euclidean minimum spanning trees for the detection of all disease cluster shapes
- Confidence regions for level sets
- Resampling approach for cluster model selection
- Euclidean Distance Matrix Completion and Point Configurations from the Minimal Spanning Tree
- Depth functions and mutidimensional medians on minimal spanning trees
- Stable components and layers
- DBSCAN: optimal rates for density-based cluster estimation
- A comprehensive approach to mode clustering
- Optimal rates for plug-in estimators of density level sets
- Determinantal consensus clustering
- The Modal Age of Statistics
- Robust aggregation of compositional and interval-valued data: the mode on the unit simplex
- A Review on Modal Clustering
- Distance Metrics and Clustering Methods for Mixed‐type Data
- Modal clustering of matrix-variate data
- Moving Up the Cluster Tree with the Gradient Flow
- Level set tree methods
- Automatic clustering for seasonal time series based on entropy
- A fast and efficient modal EM algorithm for Gaussian mixtures
- Directional density-based clustering
- Density-based clustering with non-continuous data
- An advancement in clustering via nonparametric density estimation
- Adaptive Hausdorff estimation of density level sets
- Fully adaptive density-based clustering
- Reconstructing the energy landscape of a distribution from Monte Carlo samples
This page was built for publication: Estimating the cluster tree of a density by analyzing the minimal spanning tree of a sample
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1762813)
