Open Access. Powered by Scholars. Published by Universities.®

Computer Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Computer Sciences

Approximation algorithms

Articles 1 - 1 of 1

Full-Text Articles in Computer Engineering

Enhanced Hybrid Method Of Divide-And-Conquer And Rbf Neural Networks For Function Approximation Of Complex Problems, Mohammed Awad Jan 2017

Enhanced Hybrid Method Of Divide-And-Conquer And Rbf Neural Networks For Function Approximation Of Complex Problems, Mohammed Awad

Turkish Journal of Electrical Engineering and Computer Sciences

This paper provides an enhanced method focused on reducing the computational complexity of function approximation problems by dividing the input data vectors into small groups, which avoids the curse of dimensionality. The computational complexity and memory requirements of the approximated problem are higher when the input data dimensionality increases. A divide-and-conquer algorithm is used to distribute the input data of the complex problem to a divided radial basis function neural network (Div-RBFNN). Under this algorithm, the input data variables are typically distributed to different RBFNNs based on whether the number of the input data dimensions is odd or even. In …