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

ABSTRACT 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 () 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.

Institutions

Publication Details

Journal
Concurrency and Computation Practice and Experience
Published
2026-03-24
DOI
https://doi.org/10.1002/cpe.70683
Primary Topic
Advanced Clustering Algorithms Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

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

Concurrency and Computation Practice and Experience
Advanced Clustering Algorithms Research
article

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

article en

Abstract

ABSTRACT 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 () 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.

Concurrency and Computation Practice and ExperienceVol. 38(7)
North China University of Water Resources and Electric Power (CN)
No poverty
Openalex Percentile: Top 12%
Advanced Clustering Algorithms Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.