Radial basis function network configuration using mutual information and the orthogonal least squares algorithm

被引:48
作者
Zheng, GL
Billings, SA
机构
[1] Dept. of Automat. Contr. and S., University of Sheffield, Sheffield S1 4DU, Mappin Street
基金
英国工程与自然科学研究理事会;
关键词
radial basis function; mutual information; input node selection; hidden node selection; network structure; pattern recognition; system identification;
D O I
10.1016/0893-6080(95)00139-5
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Input nodes of neural networks are usually predetermined by using a priori knowledge or selected by trial and error. For example, in pattern recognition applications the input nodes are usually the given pattern features and in system identification applications the past input and output data are often used as inputs to the network. Some of the input variables may be irrelevant to the task in hand and therefore may cause a deterioration in network performance. Some may be redundant and may increase the complexity of the network and consume expensive computation time. In the present study, the mutual information between the input variables and the output of the network is used to select a suboptimal set of input variables for the network. The variables are selected according to the information content relevant to the output. Variables which have a higher mutual information with the output and lower dependence on other selected variables are used as network inputs. The algorithms are derived based on heuristics and performance is assessed by using radial basis function (RBF) networks trained with the orthogonal least squares algorithm (OLS), which selects the hidden layer nodes of the network according to the error reduction ratios on the network output. Both real and simulated data sets are used to demonstrate the effectiveness of the new algorithms. Copyright (C) 1996 Elsevier Science Ltd.
引用
收藏
页码:1619 / 1637
页数:19
相关论文
共 31 条