
Optimasi Learning Rate Neural Network Backpropagation Dengan Search Direction Conjugate Gradient Pada Electrocardiogram
Author(s) -
Azwar Riza Habibi,
Vivi Aida Fitria,
Lukman Hakim
Publication year - 2020
Publication title -
numerical./numerical
Language(s) - English
Resource type - Journals
eISSN - 2580-2437
pISSN - 2580-3573
DOI - 10.25217/numerical.v3i2.603
Subject(s) - conjugate gradient method , backpropagation , artificial neural network , gradient descent , nonlinear conjugate gradient method , weighting , gradient method , computer science , algorithm , artificial intelligence , convergence (economics) , mathematics , pattern recognition (psychology) , physics , acoustics , economics , economic growth
This paper develops a Neural network (NN) using conjugate gradient (CG). The modification of this method is in defining the direction of linear search. The conjugate gradient method has several methods to determine the steep size such as the Fletcher-Reeves, Dixon, Polak-Ribere, Hestene Steifel, and Dai-Yuan methods by using discrete electrocardiogram data. Conjugate gradients are used to update learning rates on neural networks by using different steep sizes. While the gradient search direction is used to update the weight on the NN. The results show that using Polak-Ribere get an optimal error, but the direction of the weighting search on NN widens and causes epoch on NN training is getting longer. But Hestene Steifel, and Dai-Yua could not find the gradient search direction so they could not update the weights and cause errors and epochs to infinity.