Estimating the cluster tree of a density by analyzing the minimal spanning tree of a sample
From MaRDI portal
Publication:1762813
DOI10.1007/s00357-003-0004-6zbMath1055.62075OpenAlexW2093328450MaRDI QIDQ1762813
Publication date: 11 February 2005
Published in: Journal of Classification (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00357-003-0004-6
Density estimation (62G07) Classification and discrimination; cluster analysis (statistical aspects) (62H30)
Related Items (39)
TOBAE: a density-based agglomerative clustering algorithm ⋮ Depth functions and mutidimensional medians on minimal spanning trees ⋮ DBSCAN: Optimal Rates For Density Based Clustering ⋮ Adaptive Hausdorff estimation of density level sets ⋮ Asymptotic normality of plug-in level set estimates ⋮ Divisive clustering of high dimensional data streams ⋮ Identifying connected components in Gaussian finite mixture models for clustering ⋮ Estimation of level set trees using adaptive partitions ⋮ Optimal rates for plug-in estimators of density level sets ⋮ Modal clustering asymptotics with applications to bandwidth selection ⋮ Density-based silhouette diagnostics for clustering methods ⋮ Confidence regions for level sets ⋮ Fully adaptive density-based clustering ⋮ 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 ⋮ Resampling approach for cluster model selection ⋮ A new mixture model on the simplex ⋮ A statistical model of cluster stability ⋮ Moving Up the Cluster Tree with the Gradient Flow ⋮ Stable Components and Layers ⋮ A framework for semi-supervised and unsupervised optimal extraction of clusters from hierarchies ⋮ Data-driven density derivative estimation, with applications to nonparametric clustering and bump hunting ⋮ A Clustering Method for Categorical Ordinal Data ⋮ Mixture model modal clustering ⋮ The blind men and the elephant: on meeting the problem of multiple truths in data from clustering and pattern mining perspectives ⋮ Modal clustering using semiparametric mixtures and mode flattening ⋮ A population background for nonparametric density-based clustering ⋮ Reconstructing the energy landscape of a distribution from Monte Carlo samples ⋮ Visualizing high density clusters in multidimensional data using optimized star coordinates ⋮ A comprehensive approach to mode clustering ⋮ Density-based clustering with non-continuous data ⋮ An advancement in clustering via nonparametric density estimation ⋮ Better than the best? Answers via model ensemble in density-based clustering ⋮ Generalized cluster trees and singular measures ⋮ Euclidean Distance Matrix Completion and Point Configurations from the Minimal Spanning Tree
Uses Software
This page was built for publication: Estimating the cluster tree of a density by analyzing the minimal spanning tree of a sample
