Paper
25 March 1998 Flexible resource-allocating network for noisy data
Arindam Nag, Joydeep Ghosh
Author Affiliations +
Abstract
The resource allocating network (RAN) provides a simple and powerful method for on-line modeling with incremental growth in model complexity. However, the network growing algorithm is susceptible to outliers in the output domain. Pruning techniques subsequently proposed for RAN, though satisfactory for dealing with outliers in the input domain, are incapable of removing units grown in response to outliers in the output domain. The addition of a coarse scale unit in response to an output outlier results in a much larger network where units are wasted to negate the effect of the spurious unit. The resulting network generalizes poorly. In this paper, we discuss the problems associated with RAN in the presence of outliers, and provide a modified learning algorithm which recognizes and prunes units associated with spurious data. We also present a strategy to modify the remaining units, once a unit is pruned.
© (1998) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Arindam Nag and Joydeep Ghosh "Flexible resource-allocating network for noisy data", Proc. SPIE 3390, Applications and Science of Computational Intelligence, (25 March 1998); https://doi.org/10.1117/12.304846
Lens.org Logo
CITATIONS
Cited by 6 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Process modeling

Data modeling

Detection and tracking algorithms

Error analysis

Network architectures

Adaptive optics

Computer engineering

Back to Top