Adaptive density-based clustering algorithm with shared KNN conflict game

DOI10.1016/j.ins.2021.02.017OpenAlexW3133223208MaRDI QIDQ6086287

No author found.

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

DBSCANdensity peak clusteringconflict gameshared k-nearest-neighbour

Mathematics Subject Classification ID

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

Related Items (2)

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

Cites Work

• Unnamed Item
• Clustering by Passing Messages Between Data Points
• CECM: constrained evidential \(C\)-means algorithm
• An adaptive spectral clustering algorithm based on the importance of shared nearest neighbors
• Cure: An efficient clustering algorithm for large databases
• ECM: An evidential version of the fuzzy \(c\)-means algorithm

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