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.

模式识别
........\moshi2.cpp

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．