arrow
Return

A Variable Density-Based Clustering Algorithm Based on Reverse Nearest Neighbors

delete2026-04-01
delete0
PRE
AI
L
Liu, Baohong *
S
Su, Yang
Q
Qian, Lifeng
Z
Zeng, Renxian
DOI:10.1002/cpe.70683delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Traditional density-based clustering algorithms often fail to identify cluster boundaries when dealing with variable density data, resulting in poor clustering outcomes. In this paper, a reverse nearest neighbor variable density clustering algorithm (RNNVDBC) with only a single undetermined parameter (k) is proposed to mitigate the issue. The proposed algorithm introduces a method based on reverse nearest neighbors (RNN) and density partition approach to accurately discover clusters of varying densities, shapes, and sizes as well as noise. To verify its effectiveness, experiments on various artificial and real-world datasets with different densities are employed using RNNVDBC and the counterpart algorithms. The clustering validity metrics of adjusted rand index (ARI), normalized mutual information (NMI) and purity are implemented to evaluate their performance. The results demonstrate that the proposed algorithm is more effective to get the number and boundaries of clusters for varying density datasets better maintaining the integrity and separation between clusters.
Keywords:
density-based clustering
density partition
reverse nearest neighbors
variable density

Journal

C
CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE
IF:
1.5
Papers:
473
Citations:
0

Organization

J
Cited Papers

Cited Papers

No cited papers available