Guang-Bin Huang

Guang-Bin Huang

Auto-generated profile, based on publicly available information

Guang-Bin Huang

School of Automation, Southeast University, Nanjing, China

Research Focus & Metrics

Academic Career Length

24Years (2003-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
6 October 2011 in IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics)
Verified
Journal Article
Closed access
GHGuang-Bin Huang
Guang-Bin Huang
HZHongming Zhou
Hongming Zhou
XDXiaojian Ding
Xiaojian Ding
RZRui Zhang
Rui Zhang
Due to the simplicity of their implementations, least square support vector machine (LS-SVM) and proximal support vector machine (PSVM) have been widely used in binary classification applications. The conventional LS-SVM and PSVM cannot be used in regression and multiclass classification applications directly, although variants of LS-SVM and PSVM have been proposed to handle such cases. This paper shows that both LS-SVM and PSVM can be simplified further and a unified learning framework of LS-SVM, PSVM, and other regularization algorithms referred to extreme learning machine (ELM) can be built. ELM works for the “generalized” single-hidden-layer feedforward networks (SLFNs), but the hidden layer (or called feature mapping) in ELM need not be tuned. Such SLFNs include but are not limited to SVM, polynomial network, and the conventional feedforward neural networks. This paper shows the following: 1) ELM provides a unified learning platform with a widespread type of feature mappings and can be applied in regression and multiclass classification applications directly; 2) from the optimization method point of view, ELM has milder optimization constraints compared to LS-SVM and PSVM; 3) in theory, compared to ELM, LS-SVM and PSVM achieve suboptimal solutions and require higher computational complexity; and 4) in theory, ELM can approximate any target continuous function and classify any disjoint regions. As verified by the simulation results, ELM tends to have better scalability and achieve similar (for regression and binary class cases) or much better (for multiclass cases) generalization performance at much faster learning speed (up to thousands times) than traditional SVM and LS-SVM.

25 May 2011 in International Journal of Machine Learning and Cybernetics
Verified
Journal Article
Closed access
PDF file
GHGuang-Bin Huang
Guang-Bin Huang
DWDianhui Wang
Dianhui Wang
YLYuan Lan
Yuan Lan

1 January 2015 in Neural Networks
Verified
Journal Article
Closed access
GHGao Huang
Gao Huang
GHGuang-Bin Huang
Guang-Bin Huang
SSShiji Song
Shiji Song
KYKeyou You
Keyou You

3 April 2014 in Cognitive Computation
Verified
Journal Article
Closed access
PDF file
GHGuang-Bin Huang
Guang-Bin Huang

31 January 2005 in IEEE Transactions on Neural Networks
Verified
Journal Article
Closed access
GHGuang-Bin Huang
Guang-Bin Huang
PSP. Saratchandran
P. Saratchandran
NSN. Sundararajan
N. Sundararajan
This work presents a new sequential learning algorithm for radial basis function (RBF) networks referred to as generalized growing and pruning algorithm for RBF (GGAP-RBF). The paper first introduces the concept of significance for the hidden neurons and then uses it in the learning algorithm to realize parsimonious networks. The growing and pruning strategy of GGAP-RBF is based on linking the required learning accuracy with the significance of the nearest or intentionally added new neuron. Significance of a neuron is a measure of the average information content of that neuron. The GGAP-RBF algorithm can be used for any arbitrary sampling density for training samples and is derived from a rigorous statistical point of view. Simulation results for bench mark problems in the function approximation area show that the GGAP-RBF outperforms several other sequential learning algorithms in terms of learning speed, network size and generalization performance regardless of the sampling density function of the training data.