About Anaconda Help Download Anaconda

r / packages / r-densityclust

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) <DOI: 10.1126/science.1242072>. 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.

Click on a badge to see how to embed it in your web page
badge
https://anaconda.org/r/r-densityclust/badges/version.svg
badge
https://anaconda.org/r/r-densityclust/badges/latest_release_date.svg
badge
https://anaconda.org/r/r-densityclust/badges/latest_release_relative_date.svg
badge
https://anaconda.org/r/r-densityclust/badges/platforms.svg
badge
https://anaconda.org/r/r-densityclust/badges/license.svg
badge
https://anaconda.org/r/r-densityclust/badges/downloads.svg

© 2025 Anaconda, Inc. All Rights Reserved. (v4.0.7) Legal | Privacy Policy