K-means clustering serves as a very useful example of tidy data, and especially the distinction between the three tidying functions: `tidy`

, `augment`

, and `glance`

.

Let’s start by generating some random two-dimensional data with three clusters. Data in each cluster will come from a multivariate gaussian distribution, with different means for each cluster:

```
library(dplyr)
library(ggplot2)
library(purrr)
library(tibble)
library(tidyr)
theme_set(theme_minimal())
set.seed(27)
centers <- tibble(
cluster = factor(1:3),
num_points = c(100, 150, 50), # number points in each cluster
x1 = c(5, 0, -3), # x1 coordinate of cluster center
x2 = c(-1, 1, -2) # x2 coordinate of cluster center
)
labelled_points <- centers %>%
mutate(
x1 = map2(num_points, x1, rnorm),
x2 = map2(num_points, x2, rnorm)
) %>%
select(-num_points) %>%
unnest(c(x1, x2))
ggplot(labelled_points, aes(x1, x2, color = cluster)) +
geom_point()
```

This is an ideal case for k-means clustering. We’ll use the built-in `kmeans`

function, which accepts a dataframe with all numeric columns as it’s primary argument.

```
## K-means clustering with 3 clusters of sizes 148, 51, 101
##
## Cluster means:
## x1 x2
## 1 0.08853475 1.045461
## 2 -3.14292460 -2.000043
## 3 5.00401249 -1.045811
##
## Clustering vector:
## [1] 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3
## [38] 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3
## [75] 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 1 1 1 1 1 1 1 1 1 1 1
## [112] 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
## [149] 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
## [186] 1 1 1 1 1 1 1 1 1 1 1 1 1 3 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
## [223] 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2
## [260] 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2
## [297] 2 2 2 2
##
## Within cluster sum of squares by cluster:
## [1] 298.9415 108.8112 243.2092
## (between_SS / total_SS = 82.5 %)
##
## Available components:
##
## [1] "cluster" "centers" "totss" "withinss" "tot.withinss"
## [6] "betweenss" "size" "iter" "ifault"
```

```
## Length Class Mode
## cluster 300 -none- numeric
## centers 6 -none- numeric
## totss 1 -none- numeric
## withinss 3 -none- numeric
## tot.withinss 1 -none- numeric
## betweenss 1 -none- numeric
## size 3 -none- numeric
## iter 1 -none- numeric
## ifault 1 -none- numeric
```

The output is a list of vectors, where each component has a different length. There’s one of length 300: the same as our original dataset. There are a number of elements of length 3: `withinss`

, `tot.withinss`

, and `betweenss`

- and `centers`

is a matrix with 3 rows. And then there are the elements of length 1: `totss`

, `tot.withinss`

, `betweenss`

, and `iter`

.

These differing lengths have a deeper meaning when we want to tidy our dataset: they signify that each type of component communicates a *different kind* of information.

`cluster`

(300 values) contains information about each*point*`centers`

,`withinss`

and`size`

(3 values) contain information about each*cluster*`totss`

,`tot.withinss`

,`betweenss`

, and`iter`

(1 value) contain information about the*full clustering*

Which of these do we want to extract? There is no right answer: each of them may be interesting to an analyst. Because they communicate entirely different information (not to mention there’s no straightforward way to combine them), they are extracted by separate functions. `augment`

adds the point classifications to the original dataset:

```
## # A tibble: 300 x 3
## x1 x2 .cluster
## <dbl> <dbl> <fct>
## 1 6.91 -2.74 3
## 2 6.14 -2.45 3
## 3 4.24 -0.946 3
## 4 3.54 0.287 3
## 5 3.91 0.408 3
## 6 5.30 -1.58 3
## 7 5.01 -1.77 3
## 8 6.16 -1.68 3
## 9 7.13 -2.17 3
## 10 5.24 -2.42 3
## # ... with 290 more rows
```

The `tidy`

function summarizes on a per-cluster level:

```
## # A tibble: 3 x 5
## x1 x2 size withinss cluster
## <dbl> <dbl> <int> <dbl> <fct>
## 1 0.0885 1.05 148 299. 1
## 2 -3.14 -2.00 51 109. 2
## 3 5.00 -1.05 101 243. 3
```

And as it always does, the `glance`

function extracts a single-row summary:

```
## # A tibble: 1 x 4
## totss tot.withinss betweenss iter
## <dbl> <dbl> <dbl> <int>
## 1 3724. 651. 3073. 2
```

While these summaries are useful, they would not have been too difficult to extract out from the dataset yourself. The real power comes from combining these analyses with dplyr.

Let’s say we want to explore the effect of different choices of `k`

, from 1 to 9, on this clustering. First cluster the data 9 times, each using a different value of `k`

, then create columns containing the tidied, glanced and augmented data:

```
kclusts <- tibble(k = 1:9) %>%
mutate(
kclust = map(k, ~kmeans(points, .x)),
tidied = map(kclust, tidy),
glanced = map(kclust, glance),
augmented = map(kclust, augment, points)
)
kclusts
```

```
## # A tibble: 9 x 5
## k kclust tidied glanced augmented
## <int> <list> <list> <list> <list>
## 1 1 <kmeans> <tibble [1 x 5]> <tibble [1 x 4]> <tibble [300 x 3]>
## 2 2 <kmeans> <tibble [2 x 5]> <tibble [1 x 4]> <tibble [300 x 3]>
## 3 3 <kmeans> <tibble [3 x 5]> <tibble [1 x 4]> <tibble [300 x 3]>
## 4 4 <kmeans> <tibble [4 x 5]> <tibble [1 x 4]> <tibble [300 x 3]>
## 5 5 <kmeans> <tibble [5 x 5]> <tibble [1 x 4]> <tibble [300 x 3]>
## 6 6 <kmeans> <tibble [6 x 5]> <tibble [1 x 4]> <tibble [300 x 3]>
## 7 7 <kmeans> <tibble [7 x 5]> <tibble [1 x 4]> <tibble [300 x 3]>
## 8 8 <kmeans> <tibble [8 x 5]> <tibble [1 x 4]> <tibble [300 x 3]>
## 9 9 <kmeans> <tibble [9 x 5]> <tibble [1 x 4]> <tibble [300 x 3]>
```

We can turn these into three separate datasets each representing a different type of data: Then tidy the clusterings three ways: using `tidy`

, using `augment`

, and using `glance`

. Each of these goes into a separate dataset as they represent different types of data.

```
clusters <- kclusts %>%
unnest(tidied)
assignments <- kclusts %>%
unnest(augmented)
clusterings <- kclusts %>%
unnest(glanced)
```

Now we can plot the original points, with each point colored according to the predicted cluster.

Already we get a good sense of the proper number of clusters (3), and how the k-means algorithm functions when k is too high or too low. We can then add the centers of the cluster using the data from `tidy`

:

The data from `glance`

fits a different but equally important purpose: it lets you view trends of some summary statistics across values of k. Of particular interest is the total within sum of squares, saved in the `tot.withinss`

column.

This represents the variance within the clusters. It decreases as `k`

increases, but one can notice a bend (or “elbow”) right at k=3. This bend indicates that additional clusters beyond the third have little value. (See here for a more mathematically rigorous interpretation and implementation of this method). Thus, all three methods of tidying data provided by broom are useful for summarizing clustering output.