article · 2003

A NEW RECURRENT RADIAL BASIS FUNCTION NETWORK

Cited by 2Abstract and details only

Abstract

Cheung and Xu 2001 has presented a dual structural recurrent radial basis function (RBF) network by considering the different scales in net’s inputs and outputs. However, such a network implies that the underlying functional relationship between the net’s inputs and outputs is linear separable, which may not be true from a practical viewpoint. In this paper, we therefore propose a new recurrent RBF network. It takes the net’s input and the past outputs as an augmented input in analogy with the one in (Billings and Fung 1995), but introduces a scale tuner into the net’s hidden layer to balance the different scales between inputs and outputs. This network adaptively learns the parameters in the hidden layer together with those in the output layer. We implement this network by using a variant of extended normalized RBF (Cheung and Xu 2001) with its hidden units learned by the rival penalization controlled competitive learning (RPCCL) algorithm (Cheung 2002). The experiments have shown the outstanding performance of the proposed network in recursive function estimation.

Cite this paper

APA 7

Cheung, Y. (2003). A NEW RECURRENT RADIAL BASIS FUNCTION NETWORK.

MLA 9

Cheung, Yiu‐ming. “A NEW RECURRENT RADIAL BASIS FUNCTION NETWORK.” 2003.

Chicago

Cheung, Yiu‐ming. 2003. “A NEW RECURRENT RADIAL BASIS FUNCTION NETWORK.”

Harvard

Cheung, Y. (2003) ‘A NEW RECURRENT RADIAL BASIS FUNCTION NETWORK’.

BibTeX

@article{cheung2003recurrent,
  title = {{A NEW RECURRENT RADIAL BASIS FUNCTION NETWORK}},
  author = {Cheung, Yiu‐ming},
  year = {2003}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.