Open Access
2013 An Enhanced Wu-Huberman Algorithm with Pole Point Selection Strategy
Yan Sun, Shuxue Ding
Abstr. Appl. Anal. 2013(SI14): 1-6 (2013). DOI: 10.1155/2013/589386


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.


Download Citation

Yan Sun. Shuxue Ding. "An Enhanced Wu-Huberman Algorithm with Pole Point Selection Strategy." Abstr. Appl. Anal. 2013 (SI14) 1 - 6, 2013.


Published: 2013
First available in Project Euclid: 26 February 2014

zbMATH: 1272.68345
Digital Object Identifier: 10.1155/2013/589386

Rights: Copyright © 2013 Hindawi

Vol.2013 • No. SI14 • 2013
Back to Top