K-means clustering algorithm based on the association discovery To define a network node correlation, and build the node correlation matrix in this basis, given a K-means clustering algorithm based on a complex network of associations that way. The principle of the minimum correlation to select a new cluster center to the principle of maximum correlation pattern classification until all the nodes are divided until the end, the last under the module to determine the degree of the ideal number of community

data.txt
k_means.exe
head.h
k_means.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．