Comparative analysis of genetic algorithm, simulated annealing and cutting angle method for artificial neural networks

5Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Neural network learning is the main essence of ANN. There are many problems associated with the multiple local minima in neural networks. Global optimization methods are capable of finding global optimal solution. In this paper we investigate and present a comparative study for the effects of probabilistic and deterministic global search method for artificial neural network using fully connected feed forward multi-layered perceptron architecture. We investigate two probabilistic global search method namely Genetic algorithm and Simulated annealing method and a deterministic cutting angle method to find weights in neural network. Experiments were carried out on UCI benchmark dataset. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Ghosh, R., Ghosh, M., Yearwood, J., & Bagirov, A. (2005). Comparative analysis of genetic algorithm, simulated annealing and cutting angle method for artificial neural networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3587 LNAI, pp. 62–70). Springer Verlag. https://doi.org/10.1007/11510888_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free