Skip to main content
Have a personal or library account? Click to login
Exploring and Comparing Unsupervised Clustering Algorithms Cover

Exploring and Comparing Unsupervised Clustering Algorithms

Open Access
|Oct 2020

References

  1. Jain, A K, Murty, M N and Flynn, P J 1999 Data clustering: a review. ACM computing surveys (CSUR), 31(3): 264323. DOI: 10.1145/331499.331504
  2. Hartigan, J A and Wong, M A 1979 Algorithm AS 136: A k-means clustering algorithm. Journal of the Royal Statistical Society. Series C (Applied Statistics), 28(1): 100108. DOI: 10.2307/2346830
  3. Banfield, J D and Raftery, A E 1993 Model-based Gaussian and non-Gaussian clustering. Biometrics, 803821. DOI: 10.2307/2532201
  4. Chang, W, Cheng, J, Allaire, J, Xie, Y and McPherson, J 2015 Shiny: web application framework for R. R package version 1.2.0.
  5. Wickham, H 2016 ggplot2: Elegant graphics for data analysis. Springer. DOI: 10.1007/978-3-319-24277-4
  6. Cheng, J 2017 htmltools: Tools for HTML. R package version 0.3.6.
  7. Murdoch, D and Chow, E D 2018 ellipse: Functions for drawing ellipses and ellipse-like confidence regions. R package version 0.4.1.
  8. Perrier, V, Meyer, F and Granjon, D 2019 shinyWidgets: Custom inputs widgets for Shiny. R package version 0.4.7.
  9. Young, D, Benaglia, T, Chauveau, D and Hunter, D 2017 mixtools: Tools for Analysing Finite Mixture Models. R package version 1.1.0.
  10. McLachlan, G J, Lee, S X and Rathnayake, S I 2000 Finite mixture models. Annual Review of Statistics and Its Application, no. 0.
  11. Waggoner, P D Forthcoming Unsupervised Machine Learning for Clustering in Political and Social Research. New York: Cambridge University Press.
DOI: https://doi.org/10.5334/jors.269 | Journal eISSN: 2049-9647
Language: English
Submitted on: Mar 19, 2019
Accepted on: Sep 16, 2020
Published on: Oct 7, 2020
Published by: Ubiquity Press
In partnership with: Paradigm Publishing Services
Publication frequency: 1 issue per year

© 2020 Marc Lavielle, Philip D. Waggoner, published by Ubiquity Press
This work is licensed under the Creative Commons Attribution 4.0 License.