Adaptive density-based clustering algorithm with shared KNN conflict game

DOI10.1016/J.INS.2021.02.017MaRDI QIDQ6086287zbMATH OpenOpenAlexFDO

Authors

Publication date 9 November 2023

Published in Information Sciences (Search for Journal in Brave)

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

zbMATH Keywords

conflict gameDBSCANdensity peak clusteringshared k-nearest-neighbour

Mathematics Subject Classification ID

Statistics (62-XX) Computer science (68-XX)

Cites work

• An adaptive spectral clustering algorithm based on the importance of shared nearest neighbors
• CECM: constrained evidential C-means algorithm
• Clustering by passing messages between data points
• Cure: An efficient clustering algorithm for large databases
• ECM: An evidential version of the fuzzy c-means algorithm
• scientific article; zbMATH DE number 3340881 (Why is no real title available?)

Cited in

(2)

• A novel method for optimizing spectral rotation embedding K-means with coordinate descent
• QuickDSC: clustering by quick density subgraph estimation

This page was built for publication: Adaptive density-based clustering algorithm with shared KNN conflict game

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6086287)