GitHub / 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.
JSON API: http://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/scikit-learn-contrib%2Fdenmune-clustering-algorithm
PURL: pkg:github/scikit-learn-contrib/denmune-clustering-algorithm
Stars: 31
Forks: 9
Open issues: 0
License: bsd-3-clause
Language: Jupyter Notebook
Size: 74 MB
Dependencies parsed at:
29
Created at: over 3 years ago
Updated at: 3 months ago
Pushed at: 4 months ago
Last synced at: 2 months ago
Topics: clustering, deep-learning, machine-learning, python
- anytree >=2.8.0
- matplotlib >=3.2.1
- ngt >=1.11.6
- numpy >=1.18.5
- pandas >=1.0.3
- scikit-learn >=0.22.1
- seaborn >=0.10.1
- treelib >=1.6.1
- anytree >=2.8.0
- matplotlib >=3.2.1
- ngt >=1.11.6
- numpy >=1.18.5
- pandas >=1.0.3
- scikit-learn >=0.22.1
- seaborn >=0.10.1
- treelib >=1.6.1