scikit-learn-contrib / denmune-clustering-algorithm

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.
31Updated last month

Alternatives and similar repositories for denmune-clustering-algorithm:

Users that are interested in denmune-clustering-algorithm are comparing it to the libraries listed below