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.
No commits in the last 6 months.
Stars
32
Forks
13
Language
Jupyter Notebook
License
BSD-3-Clause
Category
Last pushed
Mar 07, 2025
Commits (30d)
0
Get this data via API
curl "https://pt-edge.onrender.com/api/v1/quality/ml-frameworks/scikit-learn-contrib/denmune-clustering-algorithm"
Open to everyone — 100 requests/day, no key needed. Get a free key for 1,000/day.
Higher-rated alternatives
scikit-learn-contrib/hdbscan
A high performance implementation of HDBSCAN clustering.
annoviko/pyclustering
pyclustering is a Python, C++ data mining library.
panagiotisanagnostou/HiPart
Hierarchical divisive clustering algorithm execution, visualization and Interactive visualization.
wq2012/SpectralCluster
Python re-implementation of the (constrained) spectral clustering algorithms used in Google's...
mqcomplab/MDANCE
MDANCE: O(N) clustering for molecular dynamics. Process 1.5M frames in 40min. 8 specialized algorithms.