kmeans.ani: Demonstration of the k-Means clustering algorithm

Description Usage Arguments Details Value Note Author(s) References See Also

View source: R/kmeans.ani.R

Description

This function provides a demo of the k-Means cluster algorithm for data containing only two variables (columns).

Usage

1
2
3
4
5
6
7
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

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 only 2 columns.

centers

Either the number of clusters or a set of initial (distinct) cluster centres. If a number, a random set of (distinct) rows in x is chosen as the initial centres.

hints

Two text strings indicating the steps of k-means clustering: move the center or find the cluster membership?

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.

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 x is clustered by the k-means method, which aims to partition the points into 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).

Value

A list with components

cluster

A vector of integers indicating the cluster to which each point is allocated.

centers

A matrix of cluster centers.

Note

This function is only for demonstration purpose. For practical applications please refer to kmeans.

Note that 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 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).

Author(s)

Yihui Xie

References

Examples at https://yihui.org/animation/example/kmeans-ani/

See Also

kmeans


animation documentation built on Oct. 7, 2021, 9:18 a.m.