densityClust: Clustering by Fast Search and Find of Density Peaks
Version 0.3

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.

Package details

AuthorThomas Lin Pedersen [aut, cre], Sean Hughes [aut], Xiaojie Qiu [aut]
Date of publication2017-10-24 12:52:51 UTC
MaintainerThomas Lin Pedersen <[email protected]>
LicenseGPL (>= 2)
Version0.3
Package repositoryView on CRAN
Installation Install the latest version of this package by entering the following in R:
install.packages("densityClust")

Try the densityClust package in your browser

Any scripts or data that you put into this service are public.

densityClust documentation built on Nov. 17, 2017, 6:27 a.m.