O'Reilly logo

Introduction to R for Business Intelligence by Jay Gendron

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

Partitioning using k-means clustering

The goal of partitioning is to place partitions and create clusters that reduce the within cluster sum of square error. In an extreme case, you could achieve a zero sum of square error if every data point existed in its own cluster. This would not be very useful though, would it? So partitioning is about finding the balance between reducing error and finding the right number of clusters.

A commonly used partitioning method is k-means. You will more often see it referred to as k-means clustering. K-means clustering places centers at k locations in the observation space to serve as the means of these k clusters. For example, if you were performing k-means clustering with k = 3, you would place three cluster means ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required