Research Article
A Novel Minimum Spanning Tree Clustering Algorithm Based on Density Core
| | Input: (the core set) | | | Output: (the result of clustering) | | (1) | Initialize the Core Set ; | | (2) | ; | | (3) | ; | | (4) | for each edge in do | | (5) | ifthen | | (6) | cut this edge; | | (7) | end if | | (8) | end for | | (9) | for each object in do | | (10) | ifthen | | (11) | ; | | (12) | ; | | (13) | ; | | (14) | whiledo | | (15) | ; | | (16) | | | (17) | end while | | (18) | end if | | (19) | end for | | (20) | Return |
|