loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The 31st Annual Simulation Symposium
On Interval Weighted Three-Layer Neural Networks
Boston, Massachusetts
April 05-April 09
ISBN: 0-8186-8418-6
M. Beheshti, University of Houston-Downtown
A. Berrached, University of Houston-Downtown
A. de Korvin, University of Houston-Downtown
C. Hu, University of Houston-Downtown
O. Sirisaengtaksin, University of Houston-Downtown
In solving application problems, the data sets used to train a neural network may not be hundred percent precise but within certain ranges. Representing data sets with intervals, we have interval neural networks. By analyzing the mathematical model, we categorize general three-layer neural network training problems into two types. One of them can be solved by finding numerical solutions of nonlinear systems of equations. The other can be transformed into nonlinear optimization problems. Reliable interval algorithms such as interval Newton/generalized bisection method and interval branch-and-bound algorithm are applied to obtain optimal weights for interval neural networks. The applicable state-of-art interval software packages are reviewed in this paper as well.
Citation:
M. Beheshti, A. Berrached, A. de Korvin, C. Hu, O. Sirisaengtaksin, "On Interval Weighted Three-Layer Neural Networks," ss, pp.188, The 31st Annual Simulation Symposium, 1998
Usage of this product signifies your acceptance of the Terms of Use.