Python聚类算法之基本K均值实例详解

作者:intergret 时间:2023-07-14 12:49:08 

本文实例讲述了Python聚类算法之基本K均值运算技巧。分享给大家供大家参考,具体如下:

基本K均值 :选择 K 个初始质心,其中 K 是用户指定的参数,即所期望的簇的个数。每次循环中,每个点被指派到最近的质心,指派到同一个质心的点集构成一个。然后,根据指派到簇的点,更新每个簇的质心。重复指派和更新操作,直到质心不发生明显的变化。


# scoding=utf-8
import pylab as pl
points = [[int(eachpoint.split("#")[0]), int(eachpoint.split("#")[1])] for eachpoint in open("points","r")]
# 指定三个初始质心
currentCenter1 = [20,190]; currentCenter2 = [120,90]; currentCenter3 = [170,140]
pl.plot([currentCenter1[0]], [currentCenter1[1]],'ok')
pl.plot([currentCenter2[0]], [currentCenter2[1]],'ok')
pl.plot([currentCenter3[0]], [currentCenter3[1]],'ok')
# 记录每次迭代后每个簇的质心的更新轨迹
center1 = [currentCenter1]; center2 = [currentCenter2]; center3 = [currentCenter3]
# 三个簇
group1 = []; group2 = []; group3 = []
for runtime in range(50):
 group1 = []; group2 = []; group3 = []
 for eachpoint in points:
   # 计算每个点到三个质心的距离
   distance1 = pow(abs(eachpoint[0]-currentCenter1[0]),2) + pow(abs(eachpoint[1]-currentCenter1[1]),2)
   distance2 = pow(abs(eachpoint[0]-currentCenter2[0]),2) + pow(abs(eachpoint[1]-currentCenter2[1]),2)
   distance3 = pow(abs(eachpoint[0]-currentCenter3[0]),2) + pow(abs(eachpoint[1]-currentCenter3[1]),2)
   # 将该点指派到离它最近的质心所在的簇
   mindis = min(distance1,distance2,distance3)
   if(mindis == distance1):
     group1.append(eachpoint)
   elif(mindis == distance2):
     group2.append(eachpoint)
   else:
     group3.append(eachpoint)
 # 指派完所有的点后,更新每个簇的质心
 currentCenter1 = [sum([eachpoint[0] for eachpoint in group1])/len(group1),sum([eachpoint[1] for eachpoint in group1])/len(group1)]
 currentCenter2 = [sum([eachpoint[0] for eachpoint in group2])/len(group2),sum([eachpoint[1] for eachpoint in group2])/len(group2)]
 currentCenter3 = [sum([eachpoint[0] for eachpoint in group3])/len(group3),sum([eachpoint[1] for eachpoint in group3])/len(group3)]
 # 记录该次对质心的更新
 center1.append(currentCenter1)
 center2.append(currentCenter2)
 center3.append(currentCenter3)
# 打印所有的点,用颜色标识该点所属的簇
pl.plot([eachpoint[0] for eachpoint in group1], [eachpoint[1] for eachpoint in group1], 'or')
pl.plot([eachpoint[0] for eachpoint in group2], [eachpoint[1] for eachpoint in group2], 'oy')
pl.plot([eachpoint[0] for eachpoint in group3], [eachpoint[1] for eachpoint in group3], 'og')
# 打印每个簇的质心的更新轨迹
for center in [center1,center2,center3]:
 pl.plot([eachcenter[0] for eachcenter in center], [eachcenter[1] for eachcenter in center],'k')
pl.show()

运行效果截图如下:

Python聚类算法之基本K均值实例详解

希望本文所述对大家Python程序设计有所帮助。

标签:Python,算法
0
投稿

猜你喜欢

  • Python数据类型最全知识总结

    2022-01-13 14:18:48
  • Python+Pygame制作简易版2048小游戏

    2022-12-01 18:05:03
  • pandas数据分组和聚合操作方法

    2023-09-07 05:15:44
  • python实现桌面托盘气泡提示

    2023-05-16 21:27:15
  • python 公共方法汇总解析

    2023-11-23 03:03:13
  • python+logging+yaml实现日志分割

    2023-12-18 01:19:08
  • python3+dlib实现人脸识别和情绪分析

    2023-10-18 12:07:10
  • cmd运行python文件时对结果进行保存的方法

    2023-03-12 03:18:02
  • ASP判断一个字符串中只包含字母和数字

    2008-08-08 12:12:00
  • Python接口自动化浅析logging封装及实战操作

    2022-12-04 12:21:44
  • 关于Internet Explorer 8

    2009-03-22 15:40:00
  • php7 参数、整形及字符串处理机制修改实例分析

    2023-11-23 19:48:31
  • Python中多个数组行合并及列合并的方法总结

    2021-10-08 11:00:23
  • Goland 的安装及激活教程(window、linux下安装)

    2024-05-08 10:51:51
  • ASP.NET连接SQL数据库的简单实例代码

    2024-01-26 06:54:27
  • css被遮挡的绝对定位

    2008-02-29 12:00:00
  • python生成以及打开json、csv和txt文件的实例

    2023-08-05 10:44:49
  • vue中Npm run build 根据环境传递参数方法来打包不同域名

    2024-04-27 16:17:22
  • django实现登录时候输入密码错误5次锁定用户十分钟

    2023-04-17 14:48:57
  • MySQL中一些鲜为人知的排序方式

    2024-01-18 03:18:12
  • asp之家 网络编程 m.aspxhome.com