Python实现K-Means聚类算法详解
本文详细介绍基于Python的K-Means聚类算法实现。作为典型的无监督学习算法,K-Means通过计算对象间距离来划分紧凑且独立的簇。文章提供了完整的Python代码示例,涵盖算法初始化、迭代优化及可视化预测过程,帮助开发者快速掌握该核心聚类技术。
K-Means算法原理概述
聚类分析属于无监督学习,K-means算法,其核心思想是基于距离进行数据分组。该算法采用距离作为相似性的评价指标,即认为两个对象之间的距离越近,其相似度就越高。算法的目标是将距离相近的对象组合在一起,从而形成紧凑且相互独立的簇。
Python代码实现
接下来展示使用Python实现K-Means算法的具体代码。
# -*- coding:utf-8 -*-
import random
import numpy as np
from matplotlib import pyplot
class K_Means(object):
# k是分组数;tolerance‘中心点误差';max_iter是迭代次数
def __init__(self, k=2, tolerance=0.0001, max_iter=300):
self.k_ = k
self.tolerance_ = tolerance
self.max_iter_ = max_iter
def fit(self, data):
self.centers_ = {}
for i in range(self.k_):
self.centers_[i] = data[random.randint(0,len(data))]
# print('center', self.centers_)
for i in range(self.max_iter_):
self.clf_ = {} #用于装归属到每个类中的点[k,len(data)]
for i in range(self.k_):
self.clf_[i] = []
# print("质点:",self.centers_)
for feature in data:
distances = [] #装中心点到每个点的距离[k]
for center in self.centers_:
# 欧拉距离
distances.append(np.linalg.norm(feature - self.centers_[center]))
classification = distances.index(min(distances))
self.clf_[classification].append(feature)
# print("分组情况:",self.clf_)
prev_centers = dict(self.centers_)
for c in self.clf_:
self.centers_[c] = np.average(self.clf_[c], axis=0)
# '中心点'是否在误差范围
optimized = True
for center in self.centers_:
org_centers = prev_centers[center]
cur_centers = self.centers_[center]
if np.sum((cur_centers - org_centers) / org_centers * 100.0) > self.tolerance_:
optimized = False
if optimized:
break
def predict(self, p_data):
distances = [np.linalg.norm(p_data - self.centers_[center]) for center in self.centers_]
index = distances.index(min(distances))
return index
if __name__ == '__main__':
x = np.array([[1, 2], [1.5, 1.8], [5, 8], [8, 8], [1, 0.6], [9, 11]])
k_means = K_Means(k=2)
k_means.fit(x)
for center in k_means.centers_:
pyplot.scatter(k_means.centers_[center][0], k_means.centers_[center][1], marker='*', s=150)
for cat in k_means.clf_:
for point in k_means.clf_[cat]:
pyplot.scatter(point[0], point[1], c=('r' if cat == 0 else 'b'))
predict = [[2, 1], [6, 9]]
for feature in predict:
cat = k_means.predict(feature)
pyplot.scatter(feature[0], feature[1], c=('r' if cat == 0 else 'b'), marker='x')
pyplot.show()至此,关于Python实现K-Means算法的介绍已完成。如需了解更多相关内容,请搜索本站历史文章或继续浏览后续文章,感谢大家的支持!
免责声明:本文内容仅供参考,不代表本站观点。转载或引用请注明出处。









