denmune-clustering-algorithm
Jupyter Notebook
★ 33
updated 1y ago
DenMune 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.
No plain-English explanation yet — one is being written right now. Check back in a minute.