K-means clustering algorithm is hard, is a typical prototype-based clustering method objective function representative, which is a method of data points to a certain distance the prototype as the optimization objective function obtained by the function extremum iteration the adjustment rules.

1、K-means学习\city.jpg
..............\kmeans_demo1.m
1、K-means学习

• 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．