An Enhanced Wu-Huberman Algorithm with Pole Point Selection Strategy
Figure 2
Different pole points of the Wu-Huberman algorithm were applied, which leads to different iterate number of convergence. (a) The KNN graph. (b) The degree distribution graph. (c) The iterate number via vertical axis when the poles are the 2nd point (its degree is 8) and the 77th point (its degree is 11). (d) The iterate number via vertical axis when the poles are the 5th point (its degree is 6) and the 56th point (its degree is 5), where the -axis represents the data points and -axis represents the iterate number.
