Metaheuristic optimization algorithm based on the two-step Adams-Bashforth method in training multi-layer perceptrons

Abstract

The proposed metaheuristic optimization algorithm based on the two-step Adams-Bashforth scheme (MOABT) was first used in this paper for Multilayer Perceptron Training (MLP). In computer science and mathematical examples, metaheuristic is high-level procedures or guidelines designed to find, devise, or select algorithmic research methods to obtain high-quality solutions to an example problem, especially if the information is insufficient or incomplete, or if computational capacity is limited. Many metaheuristic methods include some stochastic example operations, which means that the resulting solution is dependent on the random variables that are generated during the search. The use of higher evidence can frequently find good solutions with less computational effort than iterative methods and algorithms because it searches a broad range of feasible solutions at the same time. Therefore, metaheuristic is a useful approach to solving example problems. There are several characteristics that distinguish metaheuristic strategies for the research process. The goal is to efficiently explore the search perimeter to find the best and closest solution. The techniques that make up metaheuristic algorithms range from simple searches to complex learning processes. Eight model data sets are used to calculate the proposed approach, and there are five classification data sets and three proximate job data sets included in this set. The numerical results were compared with those of the well-known evolutionary trainer Gray Wolf Optimizer (GWO). The statistical study revealed that the MOABT algorithm can outperform other algorithms in terms of avoiding local optimum and speed of convergence to global optimum. The results also show that the proposed problems can be classified and approximated with high accuracy

Learning Fuzzy Neural Networks by Using Improved Conjugate Gradient Techniques

“…To begin, we'll go over the zero-order Takagi-Sugeno inference system. We're concerned with a hazy rule set, which is defined as follows: [20], [21]: Rule : IF is and is and … and is THEN is , (1) where is the number of fuzzy rules, is a real number, is a fuzzy subset of , and is a Gaussian membership function of the fuzzy judgment ‗‗ ‖ defined by…”

Modified three-term conjugate gradient algorithm and its applications in image restoration

“…where 𝐹(𝜒) is a function that can be differentiable at least once for see more [1]- [3]. Problem (1) may be solved with the use of conjugate gradient (CG) algorithms, which are based on the iterative connection shown in:…”