QuickDSC: clustering by quick density subgraph estimation
From MaRDI portal
Publication:6180215
Recommendations
- Optimized density peaks clustering algorithm based on dissimilarity measure
- scientific article; zbMATH DE number 7108734
- Cluster analysis: a further approach based on density estimation.
- Clustering methods based on kernel density estimators: mean shift algorithms
- A novel density peaks clustering algorithm based on \(k\) nearest neighbors for improving assignment process
Cites work
- scientific article; zbMATH DE number 5485566 (Why is no real title available?)
- scientific article; zbMATH DE number 3340881 (Why is no real title available?)
- Adaptive density-based clustering algorithm with shared KNN conflict game
- An incremental density-based clustering framework using fuzzy local clustering
- Clustering methods based on kernel density estimators: mean shift algorithms
- Consistent Procedures for Cluster Tree Estimation and Pruning
- Efficient graph-based image segmentation
- Extreme clustering -- a clustering method via density extreme points
- Information theoretic measures for clusterings comparison: variants, properties, normalization and correction for chance
- Introduction to Information Retrieval
- Knowledge discovery in databases: PKDD 2005. 9th European conference on principles and practice of knowledge discovery in databases, Porto, Portugal, October 3--7, 2005. Proceedings
- Miscellanea. A note on Bayesian design for the normal linear model with unknown error variance
- On the estimation of the gradient lines of a density and the consistency of the mean-shift algorithm
- Scikit-learn: machine learning in Python
- The elements of statistical learning. Data mining, inference, and prediction
This page was built for publication: QuickDSC: clustering by quick density subgraph estimation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6180215)
