This is the package for DenMune Clustering Algorithm published in paper https://doi.org/10.1016/j.patcog.2020.107589
Project description
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.
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distributions
No source distribution files available for this release.See tutorial on generating distribution archives.
Built Distribution
Close
Hashes for denmune-0.0.0.3-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 4bdfcbbea1c331b3c315005f65134a33ca312a00ffb7a69da235f014d6db2df0 |
|
MD5 | 9f50f9666524c50c7a19e50f80052c20 |
|
BLAKE2b-256 | a8dd93f459ebe96cdf1d88c9b021b4564f7023420e1ea54bb8ba73434785724a |