Research Article
[Retracted] A Dynamic Density Peak Clustering Algorithm Based on K-Nearest Neighbor
| Input: Dataset D = , K, Some tagged data C = | | Output: Clusters = {, } | | //Loop to get the first k nearest neighbors of each data and sort them. | | for each data point x in D do | | for each data point y in D do | | Calculate the distance between x and y | | end for | | Sort the data according to the distance from small to large: = | | | | for each c in C do | | | | if then | | | | end if | | end for | | end for |
|