Research Article
A Novel Minimum Spanning Tree Clustering Algorithm Based on Density Core
| | Input: (the dataset) | | | Output: Cluster Label | | (1) | Initialize the core objects set ; | | (2) | Initialize the dataset ; | | (3) | ; | | (4) | ; | | (5) | ; | | (6) | eliminate erroneous clusters; | | (7) | for each object which is unallocated do | | (8) | the label of nearest core object; | | (9) | end for | | (10) | Return |
|