densityClust (Q47176): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Swh import (talk | contribs)
SWHID from Software Heritage
 
(One intermediate revision by one other user not shown)
Property / source code repository
 
Property / source code repository: https://github.com/cran/densityClust / rank
 
Normal rank
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
Timestamp+2024-02-16T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0

Latest revision as of 01: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

    0 references
    0.3.2
    6 March 2022
    0 references
    0.1-1
    21 July 2014
    0 references
    0.2.1
    6 February 2016
    0 references
    0.3.1
    21 February 2022
    0 references
    0.3
    24 October 2017
    0 references
    0.3.3
    29 January 2024
    0 references
    0 references
    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
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers