Depot Institutionnel de l'UMBB >
Publications Scientifiques >
Communications Nationales >
Veuillez utiliser cette adresse pour citer ce document :
http://dlibrary.univ-boumerdes.dz:8080/handle/123456789/7562
|
Titre: | A new training method for solving the XOR problem |
Auteur(s): | Ladjouzi, Samir Grouni, Said Kirat, Abderrahmen Soufi, Youcef |
Mots-clés: | ANN’s phase training Single Hidden Layer Perceptron (SHLP) Neural Least Mean Square (NLMS) XOR problem Backpropagation algorithm |
Date de publication: | 2017 |
Collection/Numéro: | The 5th International Conference on Electrical Engineering – Boumerdes (ICEE-B) October 29-31, 2017, Boumerdes, Algeria;pp. 1-4 |
Résumé: | Training of Artificial Neural Networks (ANN) is an important step to make the network able to accomplish the desired task. This capacity of learning in such networks makes them applied in many applications as modeling and control. However, many of training algorithms have some drawbacks like: too many parameters to be estimated, important calculus time. In this paper, we propose a very simple method to train a Single Hidden Layer Perceptron (SHLP) based on replacing the traditional ANN’s phase training by another approach called Neural Least Mean Square (NLMS) problem resolution. The key of this method is to compute some ANN’s weights by the Least Mean Square (LMS) formula, and to leave others weights to their initial values. This new training method is applied to the classical XOR problem and the results are compared with the conventional Backpropagation algorithm. The obtained results were satisfactory and the comparison made with the classical algorithm revealed that our method allowed to reduce several parameters in the learning, namely: the computation time, the overall value of the error squared, the number of iterations and the number of weights to be adjusted |
URI/URL: | http://dlibrary.univ-boumerdes.dz:8080/handle/123456789/7562 |
Collection(s) : | Communications Nationales
|
Fichier(s) constituant ce document :
|
Tous les documents dans DSpace sont protégés par copyright, avec tous droits réservés.
|