Backpropagation Artificial Neural Network Enhancement using Beale-Powell Approach Technique

Abstract

Abstract Machine learning algorithms can study existing data to perform specific tasks. One of the well-known machine learning algorithms is the backpropagation algorithm, but this algorithm often provides poor convergence speed in the training process and a long training time. The purpose of this study is to optimize the standard backpropagation algorithm using the Beale-Powell conjugate gradient algorithm so that the training time needed to achieve convergence is not too long, which later can be used as a reference and information for solving predictive problems. The Beale-Powell conjugate gradient algorithm can solve unlimited optimization problems and is much more efficient than gradient descent-based algorithms such as standard backpropagation. The research data used for the analysis were formal education participation data in Indonesia. To be trained and tested using the 7-10-1 architecture. The results showed that the Beale-Powell Conjugate Gradient algorithm could more quickly perform the training and convergence process. However, the MSE value of testing and performance is still superior to the backpropagation algorithm. So it can be concluded that for the prediction case of Formal Education Participation in Indonesia, the Conjugate Gradient Beale-Powell algorithm is good enough to optimize the performance of backpropagation standards seen from the convergence speed and training performance.