The University of Southampton
University of Southampton Institutional Repository

Orthogonal least squares algorithm for training multi-output radial basis function networks

Orthogonal least squares algorithm for training multi-output radial basis function networks
Orthogonal least squares algorithm for training multi-output radial basis function networks
A constructive learning algorithm for multioutput radial basis function networks is presented. Unlike most network learning algorithms, which require a fixed network structure, this algorithm automatically determines an adequate radial basis function network structure during learning. By formulating the learning problem as a subset model selection, an orthogonal least-squares procedure is used to identify appropriate radial basis function centres from the network training data, and to estimate the network weights simultaneously in a very efficient manner. This algorithm has a desired property, that the selection of radial basis function centres or network hidden nodes is directly linked to the reduction in the trace of the error covariance matrix. Nonlinear system modelling and the reconstruction of pulse amplitude modulation signals are used as two examples to demonstrate the effectiveness of this learning algorithm.
378-384
Chen, S.
9310a111-f79a-48b8-98c7-383ca93cbb80
Grant, P. M.
e527fff4-da0f-4bc4-91cf-eed522070300
Cowan, C. F. N.
383ecc7c-1e78-4861-95d7-cbfeb02745a1
Chen, S.
9310a111-f79a-48b8-98c7-383ca93cbb80
Grant, P. M.
e527fff4-da0f-4bc4-91cf-eed522070300
Cowan, C. F. N.
383ecc7c-1e78-4861-95d7-cbfeb02745a1

Chen, S., Grant, P. M. and Cowan, C. F. N. (1992) Orthogonal least squares algorithm for training multi-output radial basis function networks. IEE Proceedings, Part F, 139 (6), 378-384.

Record type: Article

Abstract

A constructive learning algorithm for multioutput radial basis function networks is presented. Unlike most network learning algorithms, which require a fixed network structure, this algorithm automatically determines an adequate radial basis function network structure during learning. By formulating the learning problem as a subset model selection, an orthogonal least-squares procedure is used to identify appropriate radial basis function centres from the network training data, and to estimate the network weights simultaneously in a very efficient manner. This algorithm has a desired property, that the selection of radial basis function centres or network hidden nodes is directly linked to the reduction in the trace of the error covariance matrix. Nonlinear system modelling and the reconstruction of pulse amplitude modulation signals are used as two examples to demonstrate the effectiveness of this learning algorithm.

Text
00180510.pdf - Other
Download (567kB)

More information

Published date: 1992
Organisations: Southampton Wireless Group

Identifiers

Local EPrints ID: 251128
URI: http://eprints.soton.ac.uk/id/eprint/251128
PURE UUID: ae02a248-f6f4-4b57-a906-f13420e9b389

Catalogue record

Date deposited: 12 Oct 1999
Last modified: 14 Mar 2024 05:09

Export record

Contributors

Author: S. Chen
Author: P. M. Grant
Author: C. F. N. Cowan

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×