Research Article
A Novel Minimum Spanning Tree Clustering Algorithm Based on Density Core
Table 3
Consuming time of seven clustering methods on synthetic datasets.
| Datasets | Kmeans | DBSCAN | DPC | DCore | SNNDPC | LDP-MST | MST-DC |
| D1 | 0.0041 | 0.0124 | 2.5567 | 0.1606 | 1.5501 | 0.0322 | 0.1264 | D2 | 0.0161 | 0.6175 | 260.2096 | 5.1929 | 50.0567 | 0.7636 | 4.6564 | D3 | 0.0129 | 0.0279 | 6.0232 | 0.2155 | 4.0169 | 0.0863 | 0.2552 | D4 | 0.0159 | 0.0394 | 9.5406 | 0.4328 | 5.0190 | 0.1259 | 0.3316 | D5 | 0.0731 | 0.0662 | 4.8771 | 0.4148 | 2.9375 | 0.1018 | 1.1598 | D6 | 0.0105 | 0.0114 | 3.6684 | 0.1330 | 2.5739 | 0.0738 | 0.0841 | D7 | 0.0136 | 0.0507 | 9.6971 | 0.4514 | 6.6409 | 0.1084 | 0.6224 | D8 | 0.0088 | 0.0277 | 4.9969 | 0.3256 | 3.8173 | 0.0721 | 0.4609 | D9 | 0.0613 | 1.0585 | 563.7926 | 9.9512 | 88.2114 | 1.8526 | 9.5622 | D10 | 0.0871 | 0.7014 | 685.8524 | 13.5350 | 93.7407 | 1.9508 | 9.5915 |
|
|