Kardi Teknomo
Kardi Teknomo Kardi Teknomo Kardi Teknomo
 
Research
Publications
Tutorials
Resume
Personal
Resources
Contact

What is K-Mean Clustering?

 

<Contents | Previous | Next>

Simply speaking k-means clustering is an algorithm to classify or to group your objects based on attributes/features into K number of group. K is positive integer number. The grouping is done by minimizing the sum of squares of distances between data and the corresponding cluster centroid. Thus the purpose of K-mean clustering is to classify the data.

Example: Suppose we have 4 objects as your training data points and each object have 2 attributes. Each attribute represents coordinate of the object.

Object Attribute 1 (X):weight index Attribute 2 (Y): pH
Medicine A
1
1
Medicine B
2
1
Medicine C
4
3
Medicine D
5
4

We also know before hand that these objects belong to two groups of medicine (cluster 1 and cluster 2). The problem now is to determine which medicines belong to cluster 1 and which medicines belong to the other cluster.

Click here for numerical example (manual calculation) of the k-mean clustering.

See how the k-mean algorithm works (download free code in VB)

For distinction between supervised learning and unsupervised learning, click here.

<Contents | Previous | Next>

 
 

 
 
© 2006 Kardi Teknomo. All Rights Reserved.
Designed by CNV Media