1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
|
% Generated by roxygen2: do not edit by hand
% Please edit documentation in R/kmeans.ani.R
\name{kmeans.ani}
\alias{kmeans.ani}
\title{Demonstration of the k-Means clustering algorithm}
\usage{
kmeans.ani(
x = cbind(X1 = runif(50), X2 = runif(50)),
centers = 3,
hints = c("Move centers!", "Find cluster?"),
pch = 1:3,
col = 1:3
)
}
\arguments{
\item{x}{A numercal matrix or an object that can be coerced to such a matrix
(such as a numeric vector or a data frame with all numeric columns)
containing \emph{only} 2 columns.}
\item{centers}{Either the number of clusters or a set of initial (distinct)
cluster centres. If a number, a random set of (distinct) rows in \code{x}
is chosen as the initial centres.}
\item{hints}{Two text strings indicating the steps of k-means clustering:
move the center or find the cluster membership?}
\item{pch, col}{Symbols and colors for different clusters; the length of these
two arguments should be equal to the number of clusters, or they will be
recycled.}
}
\value{
A list with components \item{cluster }{A vector of integers
indicating the cluster to which each point is allocated.} \item{centers }{A
matrix of cluster centers.}
}
\description{
This function provides a demo of the k-Means cluster algorithm for data
containing only two variables (columns).
}
\details{
The k-Means cluster algorithm may be regarded as a series of iterations of:
finding cluster centers, computing distances between sample points, and
redefining cluster membership.
The data given by \code{x} is clustered by the \eqn{k}-means method, which
aims to partition the points into \eqn{k} groups such that the sum of squares
from points to the assigned cluster centers is minimized. At the minimum, all
cluster centres are at the mean of their Voronoi sets (the set of data points
which are nearest to the cluster centre).
}
\note{
This function is only for demonstration purpose. For practical
applications please refer to \code{\link{kmeans}}.
Note that \code{ani.options('nmax')} is defined as the maximum number of
iterations in such a sense: an iteration includes the process of computing
distances, redefining membership and finding centers. Thus there should be
\code{2 * ani.options('nmax')} animation frames in the output if the other
condition for stopping the iteration has not yet been met (i.e. the cluster
membership will not change any longer).
}
\references{
Examples at \url{https://yihui.org/animation/example/kmeans-ani/}
}
\seealso{
\code{\link{kmeans}}
}
\author{
Yihui Xie
}
|
