c( person(given = "Lampros", family = "Mouselimis", email = "mouselimislampros@gmail.com", role = c("aut", "cre"), comment = c(ORCID = "https://orcid.org/0000-0002-8024-1546")), person(given = "Conrad", family = "Sanderson", role = "cph", comment = "Author of the C++ Armadillo library"), person(given = "Ryan", family = "Curtin", role = "cph", comment = "Author of the C++ Armadillo library"), person(given = "Siddharth", family = "Agrawal", role = "cph", comment = "Author of the C code of the Mini-Batch-Kmeans algorithm (https://github.com/siddharth-agrawal/Mini-Batch-K-Means)"), person(given = "Brendan", family = "Frey", email = "frey@psi.toronto.edu", role = "cph", comment = "Author of the matlab code of the Affinity propagation algorithm (for commercial use please contact the author of the matlab code)"), person(given = "Delbert", family = "Dueck", role = "cph", comment = "Author of the matlab code of the Affinity propagation algorithm"), person(given = "Vitalie", family = "Spinu", email = "spinuvit@gmail.com", role = "ctb", comment = c(Github = "Github Contributor")) )
Lampros Mouselimis [aut, cre] (<https://orcid.org/0000-0002-8024-1546>),
Conrad Sanderson [cph] (Author of the C++ Armadillo library),
Ryan Curtin [cph] (Author of the C++ Armadillo library),
Siddharth Agrawal [cph] (Author of the C code of the Mini-Batch-Kmeans
algorithm
(https://github.com/siddharth-agrawal/Mini-Batch-K-Means)),
Brendan Frey [cph] (Author of the matlab code of the Affinity
propagation algorithm (for commercial use please contact the author
of the matlab code)),
Delbert Dueck [cph] (Author of the matlab code of the Affinity
propagation algorithm),
Vitalie Spinu [ctb] (Github Contributor)

Rcpp (>= 0.12.5), graphics, grDevices, utils, stats, gmp,
ggplot2, lifecycle

Nonparametric rank based tests (rank-sum tests and signed-rank tests) for clustered data, especially useful for clusters having informative cluster size and intra-cluster group size.

R (>= 2.2.4), Rcpp, clusterCrit, cluster, WeightedCluster
Assessment of Stability of Individual Object or Clusters in
Partitioning Solutions
Etienne Lord, Francois-Joseph Lapointe, and Vladimir Makarenkov
Allows one to assess the stability of individual objects, clusters and whole clustering solutions based on repeated runs of the K-means and K-medoids partitioning algorithms.