- Category:
- Other systems
- Tags:
-
- File Size:
- 26kb
- Update:
- 2019-05-16
- Downloads:
- 0 Times
- Uploaded by:
- 小鹏鹏123
Description: 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.
To Search:
File list (Check if you may need any files):
| Filename | Size | Date |
|---|
| 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 |
Download