本文之編寫程序涉及到API介紹，程序的完整實現，具體算法原理請查看之前所寫的K-Means算法介紹

一、基礎準備

1、python 基礎

random.uniform
方法將隨機生成下一個實數，它在[x,y]范圍內。

print(random.uniform(2,6))
#uniform(5, 10) 的隨機數為 :  6.98774810047
#uniform(7, 14) 的隨機數為 :  12.2243345905

2、numpy 基礎

mat
matrices，將數組轉換成矩陣運算

data = [[2,6],[3,6]]
print(data)
#>>[[2, 6], [3, 6]]
print(np.mat(data))
#>>[[2 6]
 [3 6]]

二、完整程序

# -*- coding: utf-8 -*-
from numpy import *
import time
import matplotlib.pyplot as plt


# 計算距離
def euclDistance(vector1, vector2):
    return sqrt(sum(power(vector2 - vector1, 2)))


# 獲取初始值
def initCentroids(dataSet, k):
    numSamples, dim = dataSet.shape
    centroids = zeros((k, dim))
    for i in range(k):
        index = int(random.uniform(0, numSamples))
        centroids[i, :] = dataSet[index, :]
    return centroids


# 聚類
def kmeans(dataSet, k):
    numSamples = dataSet.shape[0]
    clusterAssment = mat(zeros((numSamples, 2)))
    clusterChanged = True

    #獲取初始聚類中心
    centroids = initCentroids(dataSet, k)

    # 不斷迭代，指導聚類中點沒有變化
    while clusterChanged:
        clusterChanged = False
        for i in range(numSamples):
            minDist = 100000.0
            minIndex = 0
            for j in range(k):
                #計算出距離
                distance = euclDistance(centroids[j, :], dataSet[i, :])
                #求出最短的聚類點
                if distance < minDist:
                    minDist = distance
                    minIndex = j

            # 如果該點聚類有變化，則重新賦值
            if clusterAssment[i, 0] != minIndex:
                clusterChanged = True
                clusterAssment[i, :] = minIndex, minDist ** 2

        # 更新聚類中心點
        for j in range(k):
            pointsInCluster = dataSet[nonzero(clusterAssment[:, 0].A == j)[0]]
            centroids[j, :] = mean(pointsInCluster, axis=0)

    print('聚類完畢')
    return centroids, clusterAssment

#展示數據
def showCluster(dataSet, k, centroids, clusterAssment):
    numSamples, dim = dataSet.shape
    if dim != 2:
        print("Sorry! I can not draw because the dimension of your data is not 2!")
        return 1

    mark = ['or', 'ob', 'og', 'ok', '^r', '+r', 'sr', 'dr', '<r', 'pr']
    if k > len(mark):
        print("Sorry! Your k is too large! please contact Zouxy")
        return 1

    # draw all samples
    for i in range(numSamples):
        markIndex = int(clusterAssment[i, 0])
        plt.plot(dataSet[i, 0], dataSet[i, 1], mark[markIndex])

    mark = ['Dr', 'Db', 'Dg', 'Dk', '^b', '+b', 'sb', 'db', '<b', 'pb']
    # draw the centroids
    for i in range(k):
        plt.plot(centroids[i, 0], centroids[i, 1], mark[i], markersize=12)

    plt.show()


if __name__ == '__main__':
    print("加載數據")
    dataSet = []
    fileIn = open('data\\testData.txt')
    for line in fileIn.readlines():
        lineArr = line.strip().split(' ')
        dataSet.append([float(lineArr[0]), float(lineArr[1])])

    #轉化為矩陣
    dataSet = mat(dataSet)
    k = 4
    centroids, clusterAssment = kmeans(dataSet, k)
    # 最后結果
    print(centroids)
    print("顯示數據")
    showCluster(dataSet, k, centroids, clusterAssment)