nearest_cluster

For each observation the euclidean distance to each of the cluster centres is calculated and cluster with the smallest distance is return for that observation.

Performs the trimmed k-means clustering algorithm with lower memory use. It also provides a number of utility functions such as BIC calculations.

Andrew Jones

lowmemtkmeans

Low Memory Use Trimmed K-Means

nearest_cluster function

<dl><dt>data</dt>
<dd>a matrix (n x m) to be clustered</dd>
<dt>centres</dt>
<dd>matrix of cluster means (k x m), where k is the number of clusters.</dd></dl>

Arguments

Allocates each rw (observation) in data to the nearest cluster centre. — nearest_cluster

<dl>

<dt>data</dt>
<dd>a matrix (n x m) to be clustered</dd>


<dt>centres</dt>
<dd>matrix of cluster means (k x m), where k is the number of clusters.</dd>

</dl>

nearest_cluster: Allocates each rw (observation) in data to the nearest cluster centre.

Description

Usage

Value

Arguments

Examples