K均值聚类算法.docVIP

k均值算法是模式识别的聚分类问题，这是用C#实现其算法以下是程序源代码：using System;using System.Drawing;using System.Collections;using System.ComponentModel;using System.Windows.Forms;using System.Data;namespace KMean_win{ /// ?? /// Form1 的摘要说明。 ///  public class Form1 : System.Windows.Forms.Form { ///  /// 必需的设计器变量。///  private System.ComponentModel.Container components = null; private static int k = 2;????????????????????????? //类数，此例题为2类private static int total = 20;???????????????? ???? //点个数private int test = 0; private PointF[] unknown = new PointF[total];? //点数组private int[] type = new int[total];?????????? //每个点暂时的类public PointF[] z = new PointF[k];???????????????? //保存新的聚类中心public PointF[] z0 = new PointF[k];??????????????? //保存上一次的聚类中心private PointF sum; private int temp = 0; private System.Windows.Forms.TextBox textBox1; private int l = 0;????????? //迭代次数//构造函数，初始化public Form1() { unknown[0]=new Point(0,0); unknown[1]=new Point(1,0); unknown[2]=new Point(0,1); unknown[3]=new Point(1,1); unknown[4]=new Point(2,1); unknown[5]=new Point(1,2); unknown[6]=new Point(2,2); unknown[7]=new Point(3,2); unknown[8]=new Point(6,6); unknown[9]=new Point(7,6); unknown[10]=new Point(8,6); unknown[11]=new Point(6,7); unknown[12]=new Point(7,7); unknown[13]=new Point(8,7); unknown[14]=new Point(9,7); unknown[15]=new Point(7,8); unknown[16]=new Point(8,8); unknown[17]=new Point(9,8); unknown[18]=new Point(8,9); unknown[19]=new Point(9,9);  InitializeComponent();  test = 0; //选k个初始聚类中心??? z[i]???? for(int i=0;i z[i] = unknown[i]; for(int i=0;i type[i] = 0; }//计算新的聚类中心???????? public PointF newCenter(int m)???????? {????????????? int N = 0;????????????? for(int i=0;i????????????? {?????????????????? if(type[i] == m)?????????????