KEMBAR78
Kmeans Algorithm | PDF | Learning | Statistics
Scribd
Upload
79 views3 pages

Kmeans Algorithm

This document contains Python code for performing k-means clustering. It includes functions for loading data, calculating distances between data points, initializing cluster centroids randomly, assigning data points to centroids, recalculating centroids, and plotting the clustered data and centroids. The k-means clustering algorithm is implemented in a kMeans function that takes a data set, number of clusters k, and other optional parameters as input and returns the cluster centroids and assignments.

Uploaded by

MOHD HIZAMI BIN AB HALIM MAN181045
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
79 views3 pages

Kmeans Algorithm

This document contains Python code for performing k-means clustering. It includes functions for loading data, calculating distances between data points, initializing cluster centroids randomly, assigning data points to centroids, recalculating centroids, and plotting the clustered data and centroids. The k-means clustering algorithm is implemented in a kMeans function that takes a data set, number of clusters k, and other optional parameters as input and returns the cluster centroids and assignments.

Uploaded by

MOHD HIZAMI BIN AB HALIM MAN181045
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

'''

Created on Feb 16, 2011


k Means Clustering for Ch10 of Machine Learning in Action
@author: Peter Harrington
'''
from numpy import *

def loadDataSet(fileName): #general function to parse tab -delimited floats


dataMat = [] #assume last column is target value
fr = open(fileName)
for line in fr.readlines():
curLine = line.strip().split('\t')
fltLine = map(float,curLine) #map all elements to float()
dataMat.append(fltLine)
return dataMat

def distEclud(vecA, vecB):


return sqrt(sum(power(vecA - vecB, 2))) #la.norm(vecA-vecB)

def randCent(dataSet, k):


n = shape(dataSet)[1]
centroids = mat(zeros((k,n)))#create centroid mat
for j in range(n):#create random cluster centers, within bounds of each dimension
minJ = min(dataSet[:,j])
rangeJ = float(max(dataSet[:,j]) - minJ)
centroids[:,j] = mat(minJ + rangeJ * random.rand(k,1))
return centroids

def kMeans(dataSet, k, distMeas=distEclud, createCent=randCent):


m = shape(dataSet)[0]
clusterAssment = mat(zeros((m,2)))#create mat to assign data points
#to a centroid, also holds SE of each point
centroids = createCent(dataSet, k)
clusterChanged = True
while clusterChanged:
clusterChanged = False
for i in range(m):#for each data point assign it to the closest centroid
minDist = inf; minIndex = -1
for j in range(k):
distJI = distMeas(centroids[j,:],dataSet[i,:])
if distJI < minDist:
minDist = distJI; minIndex = j
if clusterAssment[i,0] != minIndex: clusterChanged = True
clusterAssment[i,:] = minIndex,minDist**2
print (centroids)
for cent in range(k):#recalculate centroids
ptsInClust = dataSet[nonzero(clusterAssment[:,0].A==cent)[0]]#get all the point in this cluster
centroids[cent,:] = mean(ptsInClust, axis=0) #assign centroid to mean
return centroids, clusterAssment
**** Untuk plot kMeans figure *****************************************************

import matplotlib
import matplotlib.pyplot as plt
def clusterClubs(k):
dataMat = [] #assume last column is target value
fr = open('testSet.txt')
for line in fr.readlines():
curLine = line.strip().split('\t')
fltLine = list(map(float,curLine)) #map all elements to float()
dataMat.append(fltLine)

datMat = mat(dataMat)
myCentroids, clustAssing = kMeans(datMat, k)
fig = plt.figure()
rect=[0.1,0.1,0.8,0.8]
scatterMarkers=['s', 'o', '^', '8', 'p', \
'd', 'v', 'h', '>', '<']
axprops = dict(xticks=[], yticks=[])
ax0=fig.add_axes(rect, label='ax0', **axprops)
ax1=fig.add_axes(rect, label='ax1', frameon=False)
for i in range(k):
ptsInCurrCluster = datMat[nonzero(clustAssing[:,0].A==i)[0],:]
markerStyle = scatterMarkers[i % len(scatterMarkers)]
ax1.scatter(ptsInCurrCluster[:,0].flatten().A[0], ptsInCurrCluster[:,1].flatten().A[0],
marker=markerStyle, s=90)
ax1.scatter(myCentroids[:,0].flatten().A[0], myCentroids[:,1].flatten().A[0], marker='+', s=300)
plt.show()

To run the function, you invoke the function and masukkan nilai k clusters
e.g.
k=3 clusters
>>clusterClubs(3)
k=4 clusters
>>clusterClubs(4)

k=5 clusters
>>clusterClubs(5)

You might also like