ClusterR (Q42969)

From MaRDI portal
Gaussian Mixture Models, K-Means, Mini-Batch-Kmeans, K-Medoids and Affinity Propagation Clustering
Language Label Description Also known as
English
ClusterR
Gaussian Mixture Models, K-Means, Mini-Batch-Kmeans, K-Medoids and Affinity Propagation Clustering

    Statements

    0 references
    0 references
    1.3.0
    21 January 2023
    0 references
    1.3.1
    29 April 2023
    0 references
    1.0.0
    6 September 2016
    0 references
    1.0.1
    9 September 2016
    0 references
    1.0.3
    8 October 2016
    0 references
    1.0.4
    2 February 2017
    0 references
    1.0.5
    11 February 2017
    0 references
    1.0.6
    3 August 2017
    0 references
    1.0.7
    14 October 2017
    0 references
    1.0.8
    28 October 2017
    0 references
    1.0.9
    30 November 2017
    0 references
    1.1.0
    17 January 2018
    0 references
    1.1.1
    26 February 2018
    0 references
    1.1.2
    4 May 2018
    0 references
    1.1.3
    21 July 2018
    0 references
    1.1.4
    22 August 2018
    0 references
    1.1.5
    5 October 2018
    0 references
    1.1.6
    8 November 2018
    0 references
    1.1.7
    10 December 2018
    0 references
    1.1.8
    11 January 2019
    0 references
    1.1.9
    14 April 2019
    0 references
    1.2.0
    18 July 2019
    0 references
    1.2.1
    29 November 2019
    0 references
    1.2.2
    12 May 2020
    0 references
    1.2.3
    3 May 2021
    0 references
    1.2.4
    4 May 2021
    0 references
    1.2.5
    21 May 2021
    0 references
    1.2.6
    28 January 2022
    0 references
    1.2.7
    21 September 2022
    0 references
    1.2.8
    3 December 2022
    0 references
    1.2.9
    13 December 2022
    0 references
    1.3.2
    4 December 2023
    0 references
    0 references
    0 references
    4 December 2023
    0 references
    Gaussian mixture models, k-means, mini-batch-kmeans, k-medoids and affinity propagation clustering with the option to plot, validate, predict (new data) and estimate the optimal number of clusters. The package takes advantage of 'RcppArmadillo' to speed up the computationally intensive parts of the functions. For more information, see (i) "Clustering in an Object-Oriented Environment" by Anja Struyf, Mia Hubert, Peter Rousseeuw (1997), Journal of Statistical Software, <doi:10.18637/jss.v001.i04>; (ii) "Web-scale k-means clustering" by D. Sculley (2010), ACM Digital Library, <doi:10.1145/1772690.1772862>; (iii) "Armadillo: a template-based C++ library for linear algebra" by Sanderson et al (2016), The Journal of Open Source Software, <doi:10.21105/joss.00026>; (iv) "Clustering by Passing Messages Between Data Points" by Brendan J. Frey and Delbert Dueck, Science 16 Feb 2007: Vol. 315, Issue 5814, pp. 972-976, <doi:10.1126/science.1136800>.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references