QuickDSC: clustering by quick density subgraph estimation

DOI10.1016/J.INS.2021.09.048OpenAlexW3199220533MaRDI QIDQ6180215FDOQ6180215

Authors:

Publication date: 19 January 2024

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2021.09.048

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

zbMATH Keywords

clusteringdensity estimation\(k\)-NN graph\(K\)-way partition

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Cites Work

• Scikit-learn: machine learning in Python
• The elements of statistical learning. Data mining, inference, and prediction
• Title not available (Why is that?)
• Information theoretic measures for clusterings comparison: variants, properties, normalization and correction for chance
• Introduction to Information Retrieval
• Extreme clustering -- a clustering method via density extreme points
• On the estimation of the gradient lines of a density and the consistency of the mean-shift algorithm
• 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
• Efficient graph-based image segmentation
• Title not available (Why is that?)
• Miscellanea. A note on Bayesian design for the normal linear model with unknown error variance
• Consistent Procedures for Cluster Tree Estimation and Pruning
• Clustering methods based on kernel density estimators: mean shift algorithms
• An incremental density-based clustering framework using fuzzy local clustering
• Adaptive density-based clustering algorithm with shared KNN conflict game

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)