Welcome to DenMune’s documentation!

DenMune Clustering Algorithm

A clustering algorithm that can find clusters of arbitrary size, shapes and densities in two-dimensions. Higher dimensions are first reduced to 2-D using the t-sne. The algorithm relies on a single parameter K (the number of nearest neighbors). The results show the superiority of DenMune. Enjoy the simplicty but the power of DenMune.


This documentation associated with the paper “DenMune: Density peak based clustering using mutual nearest neighbors”

DOI: https://doi.org/10.1016/j.patcog.2020.107589

Source code is maintained at https://github.com/scikit-learn-contrib/denmune-clustering-algorithm

User Guide / Tutorials



Participate in Competitions