### 摘要

A traditional Radial basis function (RBF) network takes Gaussian functions as its basis functions and adopts the least squares(LS) criterion as the objective function. However, it is difficult to use Gaussian functions to approximate constant values. If a function has nearly constant values in some intervals, the RBF network will be found inefficient in approximating these values. In this paper an RBF network which uses composite of sigmoidal functions to replace the Gaussian functions as the basis function of the network is proposed. It is also illustrated that the shape of the activation function can be constructed to be a similar rectangular or Gaussian function. Thus, the constant-valued functions can be approximated accurately by an RBF network. A robust objective function is also adopted in the network to replace the LS objective function. Experimental results demonstrated that the proposed network has better capability of approximation to underlying functions with a fast learning speed and high robustness to outliers.

原文 | English |
---|---|

頁面 | 496-501 |

頁數 | 6 |

出版狀態 | Published - 1996 一月 1 |

事件 | Proceedings of the 1996 IEEE International Conference on Neural Networks, ICNN. Part 1 (of 4) - Washington, DC, USA 持續時間: 1996 六月 3 → 1996 六月 6 |

### Other

Other | Proceedings of the 1996 IEEE International Conference on Neural Networks, ICNN. Part 1 (of 4) |
---|---|

城市 | Washington, DC, USA |

期間 | 96-06-03 → 96-06-06 |

### 指紋

### All Science Journal Classification (ASJC) codes

- Software

### 引用此文

*Sigmoidal radial basis function neural network for function approximation*. 496-501. 論文發表於 Proceedings of the 1996 IEEE International Conference on Neural Networks, ICNN. Part 1 (of 4), Washington, DC, USA, .

}

**Sigmoidal radial basis function neural network for function approximation.** / Tsai, Jea Rong; Chung, Pau-Choo; Chang, Chein I.

研究成果: Paper

TY - CONF

T1 - Sigmoidal radial basis function neural network for function approximation

AU - Tsai, Jea Rong

AU - Chung, Pau-Choo

AU - Chang, Chein I.

PY - 1996/1/1

Y1 - 1996/1/1

N2 - A traditional Radial basis function (RBF) network takes Gaussian functions as its basis functions and adopts the least squares(LS) criterion as the objective function. However, it is difficult to use Gaussian functions to approximate constant values. If a function has nearly constant values in some intervals, the RBF network will be found inefficient in approximating these values. In this paper an RBF network which uses composite of sigmoidal functions to replace the Gaussian functions as the basis function of the network is proposed. It is also illustrated that the shape of the activation function can be constructed to be a similar rectangular or Gaussian function. Thus, the constant-valued functions can be approximated accurately by an RBF network. A robust objective function is also adopted in the network to replace the LS objective function. Experimental results demonstrated that the proposed network has better capability of approximation to underlying functions with a fast learning speed and high robustness to outliers.

AB - A traditional Radial basis function (RBF) network takes Gaussian functions as its basis functions and adopts the least squares(LS) criterion as the objective function. However, it is difficult to use Gaussian functions to approximate constant values. If a function has nearly constant values in some intervals, the RBF network will be found inefficient in approximating these values. In this paper an RBF network which uses composite of sigmoidal functions to replace the Gaussian functions as the basis function of the network is proposed. It is also illustrated that the shape of the activation function can be constructed to be a similar rectangular or Gaussian function. Thus, the constant-valued functions can be approximated accurately by an RBF network. A robust objective function is also adopted in the network to replace the LS objective function. Experimental results demonstrated that the proposed network has better capability of approximation to underlying functions with a fast learning speed and high robustness to outliers.

UR - http://www.scopus.com/inward/record.url?scp=0029748120&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0029748120&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:0029748120

SP - 496

EP - 501

ER -