densityClust

From MaRDI portal
Revision as of 21:57, 5 March 2024 by Import240305080343 (talk | contribs) (Created automatically from import240305080343)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Software:47176



swMATH35468CRANdensityClustMaRDI QIDQ47176

Clustering by Fast Search and Find of Density Peaks

Xiaojie Qiu, Thomas Lin Pedersen, Sean Hughes

Last update: 29 January 2024

Copyright license: GNU General Public License, version 3.0, GNU General Public License, version 2.0

Software version identifier: 0.3.2, 0.1-1, 0.2.1, 0.3.1, 0.3, 0.3.3


Source code repository: https://github.com/cran/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). 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.