Fast and Robust Way of Learning the Fourier Series Neural Networks on the Basis of Multidimensional Discrete Fourier Transform

Authors:
Krzysztof Halawa
Affiliations:
Institute of Computer Engineering, Control and Robotics, Wrocław University of Technology, Wrocław, Poland 50-370
Venue:
ICAISC '08 Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing
Year:
2006

Citing 4
Cited 1

The fast Fourier transform and its applications

The fast Fourier transform and its applications
Fast Fourier transforms for nonequispaced data

SIAM Journal on Scientific Computing
On function recovery by neural networks based on orthogonal expansions

Proceedings of the second world congress on Nonlinear analysts: part 3
Performance comparison between the training method and the numerical method of the orthogonal neural network in function approximation

International Journal of Intelligent Systems

A method to improve the performance of multilayer perceptron by utilizing various activation functions in the last hidden layer and the least squares method

Neural Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

The calculation method for weights of orthogonal Fourier series neural networks on the grounds of multidimensional discrete Fourier transform is presented. The method proposed represents high speed of operation and outlier robustness. It allows easy reduction of network structure following its training process. The paper presents also the ways of applying the method to modelling of dynamic controlled systems. It is very easy to prepare a program which would allow to use the procedure proposed.