DenMune: Density peak based clustering using mutual nearest neighbors
Abstract
Many clustering algorithms fail when clusters are of arbitrary shapes, of varying densities, or the data classes are unbalanced and close to each other, even in two dimensions. A novel clustering algorithm, DenMune is presented to meet this challenge. It is based on identifying dense regions using mutual nearest neighborhoods of size K, where K is the only parameter required from the user, besides obeying the mutual nearest neighbor consistency principle. The algorithm is stable for a wide range of values of K. Moreover, it is able to automatically detect and remove noise from the clustering process as well as detecting the target clusters. It produces robust results on various low and high-dimensional datasets relative to several known state-of-the-art clustering algorithms.
Keywords
Cite
@article{arxiv.2309.13420,
title = {DenMune: Density peak based clustering using mutual nearest neighbors},
author = {Mohamed Abbas and Adel El-Zoghobi and Amin Shoukry},
journal= {arXiv preprint arXiv:2309.13420},
year = {2023}
}
Comments
pyMune is a Python package that implements this clustering algorithm proposed in this paper, DenMune. It is opensource and reproducible, doi:10.1016/j.simpa.2023.100564