Radial basis function (RBF) neural networks were shown to be a promising network model in function approximation. Training an RBF network is usually approached based on a least square criterion, accompanied with an adaptive growing technique to determine the optimal size of network. With this approach, two problems usually arise when the training patterns contain outliers. Firstly, the least square would cause the network to incorrectly interpolate the outliers. Secondly, because of the interference of outliers, the number of nodes determined by traditional growing algorithm will stuck at a certain number, causing that the proper network size cannot be reached. In order to cope with the first problem, this paper proposes a method to construct a robust criterion function to replace with the least square criterion. For solving the second problem, the paper introduces a memory mechanism into the adaptive growing technique to restrain the influence of outliers. Simulation results indicate that the robust criterion function obtained using our method can effectively reduce the influence of outliers. Furthermore, with the incorporation of memory mechanism, a better size of network can be obtained.
|出版狀態||Published - 1996 1月 1|
|事件||Proceedings of the 1996 IEEE Signal Processing Society Workshop - Kyota, Jpn|
持續時間: 1996 9月 4 → 1996 9月 6
|Other||Proceedings of the 1996 IEEE Signal Processing Society Workshop|
|期間||96-09-04 → 96-09-06|
All Science Journal Classification (ASJC) codes