Learning behaviors of stochastic gradient radial basis function network algorithms for odor sensing systems

Citations

WEB OF SCIENCE

9

초록

Learning behaviors of a radial basis function network (RBFN) using a singular value decomposition (SVD) and stochastic gradient (SG) algorithm, together named RBFSVD-SG, for odor sensing systems are analyzed, and a fast training method is proposed. RBF input data is from a conducting polymer sensor array. It is revealed in this paper that the SG algorithm for the fine-tuning of centers and widths still shows ill-behaving learning results when a sufficiently small convergence coefficient is not used. Since the tuning of centers in RBFN plays a dominant role in the performance of RBFN odor sensing systems, our analysis is focused on the center-gradient variance of the RBFNSVD-SG algorithm. We found analytically that the steady-state weight fluctuation and large values of a convergence coefficient can lead to an increase in variance of the center-gradient estimate. Based on this analysis, we propose to use the least mean square algorithm instead of SVD in adjusting the weight for stable steady-state weight behavior. Experimental results of the proposed algorithm have shown faster learning speed and better classification performance.

키워드

odorradial basis function network (RBFN)center-gradientstochastic gradient (SG)least mean square (LMS)
제목
Learning behaviors of stochastic gradient radial basis function network algorithms for odor sensing systems
저자
Kim, NByun, HGKwon, KH
DOI
10.4218/etrij.06.0105.0046
발행일
2006-02
유형
Article
저널명
ETRI Journal
28
1
페이지
59 ~ 66