Comparative performance of some popular ANN algorithms on benchmark and function approximation problems

Astronomy and Astrophysics – Astrophysics – Instrumentation and Methods for Astrophysics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

18 pages 5 figures. Accepted in Pramana- Journal of Physics

Scientific paper

10.1007/s12043-010-0029-4

We report an inter-comparison of some popular algorithms within the artificial neural network domain (viz., Local search algorithms, global search algorithms, higher order algorithms and the hybrid algorithms) by applying them to the standard benchmarking problems like the IRIS data, XOR/N-Bit parity and Two Spiral. Apart from giving a brief description of these algorithms, the results obtained for the above benchmark problems are presented in the paper. The results suggest that while Levenberg-Marquardt algorithm yields the lowest RMS error for the N-bit Parity and the Two Spiral problems, Higher Order Neurons algorithm gives the best results for the IRIS data problem. The best results for the XOR problem are obtained with the Neuro Fuzzy algorithm. The above algorithms were also applied for solving several regression problems such as cos(x) and a few special functions like the Gamma function, the complimentary Error function and the upper tail cumulative $\chi^2$-distribution function. The results of these regression problems indicate that, among all the ANN algorithms used in the present study, Levenberg-Marquardt algorithm yields the best results. Keeping in view the highly non-linear behaviour and the wide dynamic range of these functions, it is suggested that these functions can be also considered as standard benchmark problems for function approximation using artificial neural networks.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Comparative performance of some popular ANN algorithms on benchmark and function approximation problems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Comparative performance of some popular ANN algorithms on benchmark and function approximation problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Comparative performance of some popular ANN algorithms on benchmark and function approximation problems will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-391052

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.