Please cite both the package and the original articles / software in your publications:

Mouselimis L (2022). ClusterR: Gaussian Mixture Models, K-Means, Mini-Batch-Kmeans, K-Medoids and Affinity Propagation Clustering. R package version 1.2.6, https://CRAN.R-project.org/package=ClusterR.

Sanderson C, Curtin R (2016). “Armadillo: a template-based C++ library for linear algebra.” Journal of Open Source Software, 1, 26. doi: 10.21105/joss.00026.

Sanderson C, Curtin R (2018). “A User-Friendly Hybrid Sparse Matrix Class in C++.” Lecture Notes in Computer Science (LNCS), 10931, 422–430. doi: 10.1007/978-3-319-96418-8_50.

Agrawal S (2013). Mini-Batch-K-Means. https://github.com/siddharth-agrawal/Mini-Batch-K-Means.

Sculley D (2010). “Web-scale k-means clustering.” ACM Digital Library. doi: 10.1145/1772690.1772862.

Dueck D (2009). Affinity Propagation: Clustering Data by Passing Messages. Ph.D. thesis, University of Toronto. http://old.psi.toronto.edu/~psi/pubs2/2009/DDueck-thesis_printable.pdf.

Frey B, Dueck D (2007). “Clustering by Passing Messages Between Data Points.” Science, 315, 972–976. doi: 10.1126/science.1136800.

Struyf A, Hubert M, Rousseeuw P (1997). “Clustering in an Object-Oriented Environment.” Journal of Statistical Software. doi: 10.18637/jss.v001.i04.

Pham D, Dimov S, Nguyen C (2004). “Selection of K in K-means clustering.” Proceedings of the Institution of Mechanical Engineers, Part C: Journal of Mechanical Engineering Science. doi: 10.1243/095440605X8298, https://core.ac.uk/download/pdf/205410925.pdf.

Corresponding BibTeX entries:

  @Manual{,
    title = {{ClusterR}: Gaussian Mixture Models, K-Means,
      Mini-Batch-Kmeans, K-Medoids and Affinity Propagation
      Clustering},
    author = {Lampros Mouselimis},
    year = {2022},
    note = {R package version 1.2.6},
    url = {https://CRAN.R-project.org/package=ClusterR},
  }

  @Article{,
    title = {Armadillo: a template-based C++ library for linear
      algebra},
    author = {Conrad Sanderson and Ryan Curtin},
    journal = {Journal of Open Source Software},
    year = {2016},
    volume = {1},
    pages = {26},
    doi = {10.21105/joss.00026},
  }

  @Article{,
    title = {A User-Friendly Hybrid Sparse Matrix Class in C++},
    author = {Conrad Sanderson and Ryan Curtin},
    journal = {Lecture Notes in Computer Science (LNCS)},
    year = {2018},
    volume = {10931},
    pages = {422--430},
    doi = {10.1007/978-3-319-96418-8_50},
  }

  @Manual{,
    title = {Mini-Batch-K-Means},
    author = {Siddharth Agrawal},
    year = {2013},
    url = {https://github.com/siddharth-agrawal/Mini-Batch-K-Means},
  }

  @Article{,
    title = {Web-scale k-means clustering},
    author = {D. Sculley},
    journal = {ACM Digital Library},
    year = {2010},
    doi = {10.1145/1772690.1772862},
  }

  @PhdThesis{,
    title = {Affinity Propagation: Clustering Data by Passing
      Messages},
    author = {Delbert Dueck},
    year = {2009},
    school = {University of Toronto},
    url =
      {http://old.psi.toronto.edu/~psi/pubs2/2009/DDueck-thesis_printable.pdf},
  }

  @Article{,
    title = {Clustering by Passing Messages Between Data Points},
    author = {Brendan Frey and Delbert Dueck},
    journal = {Science},
    year = {2007},
    volume = {315},
    pages = {972--976},
    doi = {10.1126/science.1136800},
  }

  @Article{,
    title = {Clustering in an Object-Oriented Environment},
    author = {Anja Struyf and Mia Hubert and Peter Rousseeuw},
    journal = {Journal of Statistical Software},
    year = {1997},
    doi = {10.18637/jss.v001.i04},
  }

  @Article{,
    title = {Selection of K in K-means clustering},
    author = {D Pham and S Dimov and C Nguyen},
    journal = {Proceedings of the Institution of Mechanical Engineers,
      Part C: Journal of Mechanical Engineering Science},
    year = {2004},
    url = {https://core.ac.uk/download/pdf/205410925.pdf},
    doi = {10.1243/095440605X8298},
  }