An improved implementation (based on k-nearest neighbors) of the density peak clustering algorithm, originally described by Alex Rodriguez and Alessandro Laio (Science, 2014 vol. 344). It can handle large datasets (> 100, 000 samples) very efficiently. It was initially implemented by Thomas Lin Pedersen, with inputs from Sean Hughes and later improved by Xiaojie Qiu to handle large datasets with kNNs.
copied from cf-post-staging / r-densityclust
https://anaconda.org/conda-forge/r-densityclust/badges/version.svg
https://anaconda.org/conda-forge/r-densityclust/badges/latest_release_date.svg
https://anaconda.org/conda-forge/r-densityclust/badges/latest_release_relative_date.svg
https://anaconda.org/conda-forge/r-densityclust/badges/platforms.svg
https://anaconda.org/conda-forge/r-densityclust/badges/license.svg
https://anaconda.org/conda-forge/r-densityclust/badges/downloads.svg