An enhanced Wu-Huberman algorithm with pole point selection strategy
Summary: The Wu-Huberman clustering is a typical linear algorithm among many clustering algorithms, which illustrates data points relationship as an artificial ``circuit and then applies the Kirchhoff equations to get the voltage value on the complex circuit. However, the performance of the algorithm is crucially dependent on the selection of pole points. In this paper, we present a novel pole point selection strategy for the Wu-Huberman algorithm (named as PSWH algorithm), which aims at preserving the merit and increasing the robustness of the algorithm. The pole point selection strategy is proposed to filter the pole point by introducing sparse rate. Experiments results demonstrate that the PSWH algorithm is significantly improved in clustering accuracy and efficiency compared with the original Wu-Huberman algorithm.
- Complex networks: structure and dynamics
- Global dynamics of a nutrient-plankton system in the water ecosystem
- Graph clustering
- Manifold regularization: a geometric framework for learning from labeled and unlabeled examples
- Uniform blow-up properties for a degenerate parabolic system with nonlocal sources
This page was built for publication: An enhanced Wu-Huberman algorithm with pole point selection strategy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q370053)