Research Article
A Novel Hierarchical Clustering Algorithm Based on Density Peaks for Complex Datasets
Require: dataset , parameter | 1: Generate a tree of using Algorithm 1 and assign the whole tree as a single cluster. | 2: Sort all the edges of the tree with respect to the weights in descending order . | 3: | 4: | 5: for do | 6: , | 7: Remove and split previous subtrees into new subtrees , where denotes subtrees split from previous tree | 8: for do | 9: if then | 10: | 11: else | 12: | 13: end if | 14: end for | 15: | 16: end for |
|