Description: First C-means clustering algorithm procedures and with the following data for cluster analysis. After confirming the correct programming, using the book蔡云龙Table 1 in Appendix B of the Iris data clustering. And the use of a close neighbor of law to be fast algorithm to find sub-samples of X (for X samples four components x1 = x2 = x3 = x4 = 6 subset of the number of l = 3) of the nearest neighbor nodes and 3- neighbor nodes and X and the distance between them.
File list (Check if you may need any files):
模式识别
........\moshi2.cpp