An Enhanced Wu-Huberman Algorithm with Pole Point Selection Strategy

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 cruc...

Full description

Saved in:
Bibliographic Details
Published in:Abstract and Applied Analysis 2013-01, Vol.2013 (2013), p.405-410-743
Main Authors: Sun, Yan, Ding, Shuxue
Format: Article
Language:English
Subjects:
Accuracy
Algorithms
Circuits
Clustering
Clustering (Computers)
Community
Data mining
Mathematical analysis
Mathematical research
Poles
Robustness
Statistical analysis
Statistical methods
Strategy
Studies
Voltage
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
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.
ISSN:1085-3375
1687-0409
DOI:10.1155/2013/589386