thomasp85/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.

Getting started

Package details

MaintainerThomas Lin Pedersen <thomasp85@gmail.com>
LicenseGPL (>= 2)
Version0.3.3.9000
URL https://github.com/thomasp85/densityClust
Package repositoryView on GitHub
Installation Install the latest version of this package by entering the following in R:
install.packages("remotes")
remotes::install_github("thomasp85/densityClust")
thomasp85/densityClust documentation built on Feb. 7, 2024, 7:20 a.m.