densityClust (Q47176): Difference between revisions
From MaRDI portal
Created claim: source code repository (P339): https://github.com/cran/densityClust, #quickstatements; #temporary_batch_1711029738451 |
Swh import (talk | contribs) SWHID from Software Heritage |
||||||||||||||
| Property / Software Heritage ID | |||||||||||||||
| Property / Software Heritage ID: swh:1:snp:107a9528f2ad5c330a5f20ed66f94a6a56c42567 / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / Software Heritage ID: swh:1:snp:107a9528f2ad5c330a5f20ed66f94a6a56c42567 / qualifier | |||||||||||||||
| Property / Software Heritage ID: swh:1:snp:107a9528f2ad5c330a5f20ed66f94a6a56c42567 / qualifier | |||||||||||||||
point in time: 16 February 2024
| |||||||||||||||
Latest revision as of 02:26, 22 March 2024
Clustering by Fast Search and Find of Density Peaks
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | densityClust |
Clustering by Fast Search and Find of Density Peaks |
Statements
29 January 2024
0 references
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.
0 references
expanded from: GPL (≥ 2) (English)
0 references
