Automatic topography of high-dimensional data sets by non-parametric density peak clustering
From MaRDI portal
Publication:2127128
Abstract: Data analysis in high-dimensional spaces aims at obtaining a synthetic description of a data set, revealing its main structure and its salient features. We here introduce an approach providing this description in the form of a topography of the data, namely a human-readable chart of the probability density from which the data are harvested. The approach is based on an unsupervised extension of Density Peak clustering and a non-parametric density estimator that measures the probability density in the manifold containing the data. This allows finding automatically the number and the height of the peaks of the probability density, and the depth of the "valleys" separating them. Importantly, the density estimator provides a measure of the error, which allows distinguishing genuine density peaks from density fluctuations due to finite sampling. The approach thus provides robust and visual information about the density peaks' height, their statistical reliability, and their hierarchical organization, offering a conceptually powerful extension of the standard clustering partitions. We show that this framework is particularly useful in the analysis of complex data sets.
Recommendations
- Hill-climbing, density-based clustering and equiprobabilistic topographic maps
- An advancement in clustering via nonparametric density estimation
- Generalized density clustering
- Data-driven density derivative estimation, with applications to nonparametric clustering and bump hunting
- Extreme clustering -- a clustering method via density extreme points
Cites work
- A general framework for dimensionality-reducing data visualization mapping
- A novel density peaks clustering algorithm based on \(k\) nearest neighbors for improving assignment process
- Consistency of Single Linkage for High-Density Clusters
- Consistent Procedures for Cluster Tree Estimation and Pruning
- Geometric diffusions as a tool for harmonic analysis and structure definition of data: diffusion maps
- Information theoretic measures for clusterings comparison: variants, properties, normalization and correction for chance
- Intrinsic dimension estimation: advances and open problems
- Multidimensional binary search trees used for associative searching
- Multidimensional scaling. I: Theory and method
- Nonparametric testing of the existence of modes
- Robust path-based spectral clustering
- Scikit-learn: machine learning in Python
- Variational inference for Dirichlet process mixtures
- Visualizing data using t-SNE
Cited in
(3)
This page was built for publication: Automatic topography of high-dimensional data sets by non-parametric density peak clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2127128)
