densityClust (Q47176)

From MaRDI portal
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 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
    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