# scikit-learn: Theory of K-Means Clustering

In this course, we will explore a class of unsupervised machine learning models: clustering algorithms. Clustering algorithms seek to automatically learn, from the properties of the data, an optimal partitioning of the points into a discrete labeling of groups.

k-Means clustering is presented first as an algorithm and then as an approach to minimizing a particular objective function. One challenge with clustering algorithms is that it’s not obvious how to measure success.

First 2 tasks free. Then, decide to pay \$9.99 for the rest

We will cover the following tasks in 52 minutes:

### Introduction

In this chapter, let’s go over the course objectives and get a feel of the course material we will encounter later. We get to look at a few motivating examples of k-means clustering, and then build our own implementation.

### Setting

In this chapter, we start out by cultivating our intuition for the settings most appropriate for k-Means clustering. Next, we generate a two-dimensional dataset containing four distinct blobs. To emphasize that this is an unsupervised algorithm, we will leave the labels out of the visualization.

### k-Means: By Example

Now that we have intuitive understanding of k-means, we will implement a clustering on our dataset from Chapter 2 using sklearn.cluster.KMeans. Lastly, we use our intuition to build a mathematically sound construction of k-means objective function.

### Plotting the Results

Let’s visualize the results by plotting the data colored according to labels. We will also plot the cluster centers as determined by the k-means estimator:

### Algorithm: Expectation-Maximization

In this chapter, we break down the work-horse behind k-means: the EM algorithm. Once we understand the fundamentals thoroughly, we implement the EM algorithm from scratch and visualize our results!

### Failure Cases: Suboptimal Local Minimum

Here we look at situations where k-means fails in practice, and try to piece together why this is so.

First, although the E–M procedure is guaranteed to improve the result in each step, there is no assurance that it will lead to the global best solution. For example, if we use a different random seed in our simple procedure, the particular starting guesses lead to poor results.

### Failure Cases: Number of Clusters

Another common challenge with k-means is that you must tell it how many clusters you expect: it cannot learn the number of clusters from the data. For example, if we ask the algorithm to identify six clusters, it will happily proceed and find the best six clusters.

## Watch Preview

Preview the instructions that you will follow along in a hands on session in your browser.

## About the Host (Snehan Kekre)

Snehan hosts Machine Learning courses at Rhyme. He is in his senior year of university at the Minerva Schools at KGI, pursuing a double major in the Natural Sciences and Computational Sciences, with a focus on physics and machine learning. When not applying computational and quantitative methods to identify the structures shaping the world around him, he can sometimes be seen trekking in the mountains of Nepal.

##### How is this different from YouTube, PluralSight, Udemy, etc.?
In Rhyme, all sessions are completely hands on. You don't just passively watch someone else. You use the software directly while following the host's (Snehan Kekre) instructions. Using the software is the only way to achieve mastery. With the "Live Guide" option, you can ask for help and get immediate response.
##### Can I buy Rhyme sessions for my company or learning institution?
Absolutely. We offer Rhyme for workgroups as well larger departments and companies. Universities, academies, and bootcamps can also buy Rhyme for their settings. You can select sessions and trainings that are mission critical for you and, as well, author your own that reflect your own needs and tech environments. Please email us at help@rhyme.com
##### I have a different question
Please email us at help@rhyme.com and we'll respond to you within one business day.

## More Sessions by Snehan Kekre

###### scikit-learn: Fundamentals of Support Vector Machines
1 hour and 40 minutes
25 minutes
###### scikit-learn: Logistic Regression for Sentiment Analysis
1 hour and 26 minutes
###### scikit-learn: Predict Sales Revenue using Multiple Linear Regression
1 hour and 11 minutes
###### scikit-learn: Predicting Sales Revenue with Simple Linear Regression
1 hour and 4 minutes
###### scikit-learn: K-Means Clustering In Practice
1 hour and 1 minute