A new interpoint distance-based clustering algorithm using kernel density estimation
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3793445 (Why is no real title available?)
- scientific article; zbMATH DE number 3579840 (Why is no real title available?)
- scientific article; zbMATH DE number 4001209 (Why is no real title available?)
- scientific article; zbMATH DE number 847282 (Why is no real title available?)
- scientific article; zbMATH DE number 3340881 (Why is no real title available?)
- A new algorithm for clustering based on kernel density estimation
- A new nonparametric interpoint distance-based measure for assessment of clustering
- A two-sample test for high-dimensional data with applications to gene-set testing
- Algorithm AS 136: A K-Means Clustering Algorithm
- An introduction to copulas.
- Clustering of gamma-ray bursts through kernel principal component analysis
- Finite mixture models
- Multivariate multidistance tests for high-dimensional low sample size case-control studies
- Numerical methods for fuzzy clustering
- On the estimation of the gradient lines of a density and the consistency of the mean-shift algorithm
- Silhouettes: a graphical aid to the interpretation and validation of cluster analysis
- Unsupervised classification of eclipsing binary light curves through \(k\)-medoids clustering
- Well-Separated Clusters and Optimal Fuzzy Partitions
This page was built for publication: A new interpoint distance-based clustering algorithm using kernel density estimation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6971802)