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.
[email protected] is safe to use (health: 49/100)
Get this data programmatically — free, no authentication.
curl https://depscope.dev/api/check/conda/r-densityclustFirst published · 2021-05-27 04:11:16.301000+00:00
Last updated · 2025-09-22 22:02:54.591000+00:00