Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
115 views

A Tutorial On Clustering Algorithms

K-means clustering is an algorithm that partitions observations into k clusters by minimizing the within-cluster sum of squares. It works by [1] randomly initializing k cluster centroids, [2] assigning each observation to the nearest centroid, and [3] recalculating the centroid positions. This process repeats until convergence. While simple, k-means is sensitive to initialization and may find local optima rather than global optima. It also requires specifying the number of clusters k in advance.

Uploaded by

jczerna
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
115 views

A Tutorial On Clustering Algorithms

K-means clustering is an algorithm that partitions observations into k clusters by minimizing the within-cluster sum of squares. It works by [1] randomly initializing k cluster centroids, [2] assigning each observation to the nearest centroid, and [3] recalculating the centroid positions. This process repeats until convergence. While simple, k-means is sensitive to initialization and may find local optima rather than global optima. It also requires specifying the number of clusters k in advance.

Uploaded by

jczerna
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

A Tutorial on Clustering Algorithms

Introduction | K-means | Fuzzy C-means | Hierarchical | Mixture of


Gaussians | Links

K-Means Clustering
The Algorithm
K-means (MacQueen, 1967) is one of the simplest unsupervised learning
algorithms that solve the well known clustering problem. The procedure
follows a simple and easy way to classify a given data set through a certain
number of clusters (assume k clusters) fixed a priori. The main idea is to
define k centroids, one for each cluster. These centroids shoud be placed in a
cunning way because of different location causes different result. So, the
better choice is to place them as much as possible far away from each other.
The next step is to take each point belonging to a given data set and associate
it to the nearest centroid. When no point is pending, the first step is completed
and an early groupage is done. At this point we need to re-calculate k new
centroids as barycenters of the clusters resulting from the previous step. After
we have these k new centroids, a new binding has to be done between the
same data set points and the nearest new centroid. A loop has been generated.
As a result of this loop we may notice that the k centroids change their
location step by step until no more changes are done. In other words centroids
do not move any more.
Finally, this algorithm aims at minimizing an objective function, in this case a
squared error function. The objective function

where is a chosen distance measure between a data point and


the cluster centre , is an indicator of the distance of the n data points from
their respective cluster centres.

The algorithm is composed of the following steps:

1. Place K points into the space represented by the objects


that are being clustered. These points represent initial
group centroids.
2. Assign each object to the group that has the closest
centroid.
3. When all objects have been assigned, recalculate the
positions of the K centroids.
4. Repeat Steps 2 and 3 until the centroids no longer move.
This produces a separation of the objects into groups
from which the metric to be minimized can be calculated.

Although it can be proved that the procedure will always terminate, the k-
means algorithm does not necessarily find the most optimal configuration,
corresponding to the global objective function minimum. The algorithm is
also significantly sensitive to the initial randomly selected cluster centres. The
k-means algorithm can be run multiple times to reduce this effect.

K-means is a simple algorithm that has been adapted to many problem


domains. As we are going to see, it is a good candidate for extension to work
with fuzzy feature vectors.

An example
Suppose that we have n sample feature vectors x1, x2, ..., xn all from the same
class, and we know that they fall into k compact clusters, k < n. Let mi be the
mean of the vectors in cluster i. If the clusters are well separated, we can use a
minimum-distance classifier to separate them. That is, we can say that x is in
cluster i if || x - mi || is the minimum of all the k distances. This suggests the
following procedure for finding the k means:

 Make initial guesses for the means m1, m2, ..., mk


 Until there are no changes in any mean
o Use the estimated means to classify the samples into clusters
o For i from 1 to k
 Replace mi with the mean of all of the samples for cluster
i
o end_for
 end_until

Here is an example showing how the means m1 and m2 move into the centers
of two clusters.
Remarks
This is a simple version of the k-means procedure. It can be viewed as a
greedy algorithm for partitioning the n samples into k clusters so as to
minimize the sum of the squared distances to the cluster centers. It does have
some weaknesses:

 The way to initialize the means was not specified. One popular way to
start is to randomly choose k of the samples.
 The results produced depend on the initial values for the means, and it
frequently happens that suboptimal partitions are found. The standard
solution is to try a number of different starting points.
 It can happen that the set of samples closest to mi is empty, so
that mi cannot be updated. This is an annoyance that must be handled in
an implementation, but that we shall ignore.
 The results depend on the metric used to measure || x - mi ||. A popular
solution is to normalize each variable by its standard deviation, though
this is not always desirable.
 The results depend on the value of k.

This last problem is particularly troublesome, since we often have no way of


knowing how many clusters exist. In the example shown above, the same
algorithm applied to the same data produces the following 3-means clustering.
Is it better or worse than the 2-means clustering?

Unfortunately there is no general theoretical solution to find the optimal


number of clusters for any given data set. A simple approach is to compare the
results of multiple runs with different k classes and choose the best one
according to a given criterion (for instance the Schwarz Criterion -
see Moore's slides), but we need to be careful because increasing k results in
smaller error function values by definition, but also an increasing risk of
overfitting.

Bibliography

 J. B. MacQueen (1967): "Some Methods for classification and Analysis


of Multivariate Observations, Proceedings of 5-th Berkeley Symposium
on Mathematical Statistics and Probability", Berkeley, University of
California Press, 1:281-297
 Andrew Moore: “K-means and Hierarchical Clustering - Tutorial
Slides”
http://www-2.cs.cmu.edu/~awm/tutorials/kmeans.html
 Brian T. Luke: “K-Means Clustering”
http://fconyx.ncifcrf.gov/~lukeb/kmeans.html
 Tariq Rashid: “Clustering”
http://www.cs.bris.ac.uk/home/tr1690/documentation/fuzzy_clustering_
initial_report/node11.html
 Hans-Joachim Mucha and Hizir Sofyan: “Nonhierarchical Clustering”
http://www.quantlet.com/mdstat/scripts/xag/html/xaghtmlframe149.ht

WEBSITE:

https://home.deib.polimi.it/matteucc/Clustering/tutorial_html/kmeans.html

You might also like