没有合适的资源?快使用搜索试试~ 我知道了~
k均值算法是模式识别的聚分类问题,这是用C#实现其算法
资源推荐
资源详情
资源评论
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; //迭代次数
以下是程序源代码:
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 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;
剩余6页未读,继续阅读
资源评论
bb0203
- 粉丝: 0
- 资源: 16
上传资源 快速赚钱
- 我的内容管理 展开
- 我的资源 快来上传第一个资源
- 我的收益 登录查看自己的收益
- 我的积分 登录查看自己的积分
- 我的C币 登录后查看C币余额
- 我的收藏
- 我的下载
- 下载帮助
安全验证
文档复制为VIP权益,开通VIP直接复制
信息提交成功