QuickDSC: clustering by quick density subgraph estimation

DOI10.1016/j.ins.2021.09.048OpenAlexW3199220533MaRDI QIDQ6180215

No author found.

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

• 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
• Extreme clustering -- a clustering method via density extreme points
• An incremental density-based clustering framework using fuzzy local clustering
• Efficient graph-based image segmentation
• Consistent Procedures for Cluster Tree Estimation and Pruning
• Introduction to Information Retrieval
• Miscellanea. A note on Bayesian design for the normal linear model with unknown error variance
• The elements of statistical learning. Data mining, inference, and prediction
• Adaptive density-based clustering algorithm with shared KNN conflict game
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: QuickDSC: clustering by quick density subgraph estimation