Function Approximation Using Tensor Product Bernstein Polynomials-Neuro & Evolutionary Approaches

Authors:
Manuela Buzoianu;Florin Oltean;Alexandru Agapie
Affiliations:
-;-;-
Venue:
Proceedings of the 6th International Conference on Computational Intelligence, Theory and Applications: Fuzzy Days
Year:
1999

Citing 4
Cited 0

Introduction to the theory of neural computation

Introduction to the theory of neural computation
Neural networks: algorithms, applications, and programming techniques

Neural networks: algorithms, applications, and programming techniques
Genetic algorithms + data structures = evolution programs (3rd ed.)

Genetic algorithms + data structures = evolution programs (3rd ed.)
An overview of evolutionary algorithms for parameter optimization

Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces an approximation technique based on Tensor Product Bernstein Polynomials (TPBPs) and Genetic Algorithms (GAs), res. Neural Networks (NN). First we present the basic model of TPBP, for which suitable control points need to be found, and some of the GA & NN theoretical features. Then we illustrate the efficiency of GAs on multi-parameter optimization in problem of finding optimal control points for TPBPs and the efficiency of NN in our approximation problem. We find these approaches very robust and having good generalization abilities.