DocumentCode :
3180586
Title :
Application of recursive orthogonal least squares algorithms to training and the structure optimization of radial basis probabilistic neural networks
Author :
Zhao, Wenbo ; Huang, De-Shuang
Author_Institution :
Dept. of Autom., Univ. of Sci. & Technol. of China, China
Volume :
2
fYear :
2002
fDate :
26-30 Aug. 2002
Firstpage :
1211
Abstract :
The paper introduces applying recursive orthogonal least squares algorithm (ROLSA) to training radial basis probabilistic neural networks (RBPNN) and selecting their hidden centers. First, ROLSA is used to solve the weights between the second layer and the output layer of RBPNN. Second, we interpret the basic principle of selecting hidden centers and give a detailed selection procedure. In addition, we deduce the solution of orthogonal decomposition terms under the condition of varying centers. Finally, a two-spirals problem is presented to testify to the effectiveness and efficiency of our algorithms. The experimental results show that our algorithm is very effective and feasible.
Keywords :
learning (artificial intelligence); least squares approximations; radial basis function networks; hidden center selection; orthogonal decomposition terms; radial basis neural networks; radial basis probabilistic neural networks; recursive least squares algorithms; recursive orthogonal least squares algorithms; training; two-spirals problem; Automation; Computer networks; Cost function; Intelligent networks; Least squares methods; Matrices; Matrix decomposition; Neural networks; Neurons; Testing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Signal Processing, 2002 6th International Conference on
Print_ISBN :
0-7803-7488-6
Type :
conf
DOI :
10.1109/ICOSP.2002.1180008
Filename :
1180008
Link To Document :
بازگشت