蚁群算法源代码.docVIP

WORD格式可编辑 专业知识分享 基本思想：基于LF算法的改进，将蚂蚁的拾起和放下策略用蚂蚁周围数据的信息熵的改变来判断，基于的事实为“包含聚类的子空间的信息熵比不包含聚类的信息熵小”。 form1.cs文件： using System; using System.Collections.Generic; using System.ComponentModel; using System.Data; using System.Drawing; using System.Text; using System.Windows.Forms; using System.Data.OleDb; using System.Diagnostics; namespace AntClust { public partial class Form1 : Form { public Form1() { InitializeComponent(); } int tMax = 30000; //最外层迭代次数 int antC = 50; //蚂蚁数 int gridN = 30; //网格维数,gridN*gridN int atrCount = 4; //数据对象属性个数 ListNode nodeAll=new ListNode (); //所有节点集合 ListAnt antAll=new ListAnt (); //所有蚂蚁集合 ListdataObj dataObjAll=new ListdataObj ();//所有数据对象集合 private void Form1_Load(object sender, EventArgs e) { } private void button1_Click(object sender, EventArgs e) { //从数据库读取数据 String connectionString = Provider=Microsoft.Jet.OLEDB.4.0;Data Source=data.mdb; OleDbConnection connection = new OleDbConnection(connectionString); OleDbDataAdapter ad = new OleDbDataAdapter(select * from Iris, connection); DataSet ds = new DataSet(); ad.Fill(ds); //生成节点 for (int i = 0; i gridN; i ) { for (int j = 0; j gridN; j ) { nodeAll.Add(new Node (i,j)); } } //生成蚂蚁 for (int i = 0; i antC; i ) { antAll.Add(new Ant ()); } //生成数据对象 atrCount =ds.Tables[0].Columns .Count-1 ; for (int i = 0; i ds.Tables[0].Rows.Count; i ) { Single[] datatemp = new Single[atrCount]; for (i