文件名称:Umoshishibies
介绍说明--下载内容均来自于网络,请自行研究使用
先用C-均值聚类算法程序,并用下列数据进行聚类分析。在确认编程正确后,采用蔡云龙书的附录B中表1的Iris数据进行聚类。然后使用近邻法的快速算法找出待分样本X(设X样本的4个分量x1=x2=x3=xx4=6;子集数l=3)的最近邻节点和3-近邻节点及X与它们之间的距离.-C-means clustering procedure, and the following data and cluster analysis. Confirm the programming is correct, Cai Yunlong Appendix B of Table 1 of the Iris data clustering. And then use a fast nearest neighbor algorithm to find out to be sub-sample of X (four components of the sample Let X x1 = x2 = x3 = xx4 = 6 nearest neighbor nodes of a subset of the number of l = 3) and 3- nearest neighbor nodes and X the distance between them.-First C-means clustering algorithm procedures and with the follo
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Umoshishibies\模式识别\moshi2.cpp
.............\模式识别
Umoshishibies
.............\模式识别
Umoshishibies