The main results are as follows: 1) the condensed hierarchical clustering algorithm (that is, the minimum spanning tree algorithm) is used to cluster all the data points, and finally it is grouped into three categories. Any of the single linkage,complete linkage,average linkage or average group linkage methods can be selected for the definition of dissimilarity. 2) using C-Means algorithm to cluster all data points. C = 3.

Filename	Size	Update
NMI.py	2072	2018-12-29
readData.py	1059	2018-12-28
Xie_Beni.py	959	2019-01-01
agens.py	2966	2018-12-30
cmeans.py	3383	2019-01-01
dataSet.xlsx	22172	2018-11-02
GMM.py	5052	2018-12-29
graph.py	530	2018-12-28

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