Description: 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
To Search:
File list (Check if you may need any files):
Umoshishibies\模式识别\moshi2.cpp
.............\模式识别
Umoshishibies
Download