Robust incremental growing multi-experts network

LOO, C and RAJESWARI, M and RAO, M (2006) Robust incremental growing multi-experts network. Applied Soft Computing, 6 (2). pp. 139-153. ISSN 15684946

Full text not available from this repository.
Official URL: http://dx.doi.org/10.1016/j.asoc.2004.12.003

Abstract

Most supervised neural networks are trained by minimizing the mean square error (MSE) of the training set. In the presence of outliers, the resulting neural network model can differ significantly from the underlying model that generates the data. This paper outlines two robust learning methods for a dynamic structure neural network called incremental growing multi-experts network (IGMN). It is convincingly shown by simulation that by using a scaled robust objective function instead of the least squares function, the influence of the outliers in the training data can be completely eliminated. The network generates a much better approximation in the neighborhood of outliers. Thus, the two proposed robust learning methods namely robust least mean squares (RLMSs) and least mean log squares (LMLSs) are insensitive to the presence of outliers unlike the least mean squares (LMSs) cost function. Moreover, various types of supervised learning algorithms can easily adopt LMLS, which is a parameter-free method. (C) 2005 Elsevier B. V. All rights reserved.

Item Type: Article
Subjects: Q Science > QA Mathematics > QA75.5-76.95 Electronic computers. Computer science
Divisions: Faculty of Information Science and Technology (FIST)
Depositing User: Ms Rosnani Abd Wahab
Date Deposited: 10 Aug 2011 06:39
Last Modified: 10 Aug 2011 06:39
URI: http://shdl.mmu.edu.my/id/eprint/2057

Actions (login required)

View Item View Item