@Hartigan1979

ms609 · Oct 7, 2022 · 289421c · 289421c
1 parent 9ce06b7
commit 289421c
Show file tree

Hide file tree

Showing 3 changed files with 18 additions and 4 deletions.
diff --git a/R/kmeanspp.R b/R/kmeanspp.R
@@ -1,8 +1,9 @@
 #' k-means++ clustering
 #'
 #' k-means++ clustering \insertCite{Arthur2007}{TreeDist} improves the speed and
-#' accuracy of standard \code{\link[stats]{kmeans}} clustering by preferring
-#' initial cluster centres that are far from others.
+#' accuracy of standard \code{\link[stats]{kmeans}} clustering
+#' \insertCite{Hartigan1979}{TreeDist} by preferring initial cluster centres 
+#' that are far from others.
 #' A scalable version of the algorithm has been proposed for larger data sets
 #' \insertCite{Bahmani2012}{TreeDist}, but is not implemented here.
 #' 

diff --git a/inst/REFERENCES.bib b/inst/REFERENCES.bib
@@ -188,6 +188,18 @@ @article{Gower1966
   pages = {325--338}
 }
 
+@article{Hartigan1979,
+  title = {Algorithm {{AS}} 136: a {{{\emph{K}}}}-means clustering algorithm},
+  author = {Hartigan, J. A. and Wong, M. A.},
+  year = {1979},
+  journal = {Journal of the Royal Statistical Society. Series C (Applied Statistics)},
+  volume = {28},
+  number = {1},
+  pages = {100--108},
+  publisher = {{[Wiley, Royal Statistical Society]}},
+  doi = {10.2307/2346830}
+}
+
 @article{Jonker1987,
   title = {A shortest augmenting path algorithm for dense and sparse linear assignment problems},
   volume = {38},

diff --git a/man/kmeanspp.Rd b/man/kmeanspp.Rd