densityClust
Clustering by Fast Search and Find of Density Peaks
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.
- Version0.3.3
- R versionunknown
- LicenseGPL-2
- LicenseGPL-3
- Needs compilation?Yes
- Last release01/29/2024
Documentation
Team
Thomas Lin Pedersen
Sean Hughes
Show author detailsRolesAuthorXiaojie Qiu
Show author detailsRolesAuthor
Insights
Last 30 days
Last 365 days
The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.
Data provided by CRAN
Binaries
Dependencies
- Imports7 packages
- Suggests2 packages
- Linking To1 package
- Reverse Suggests1 package