An algorithm of incremental construction of nonlinear parametric approximators

• Autorzy: Arabas J. , Dydyński A.
• Konferencja: Evolutionary Computation and Global Optimization 2006 / National Conference (9 ; 31.05-2.06.2006 ; Murzasichle, Poland)
• Języki publikacji: EN

Abstrakty

EN

A novel algorithm of incremental construction of nonlinear parametric approximators is introduced that needs a relatively small number of parameters to achieve good accuracy. The approximator is defined as a linear combination of nonlinear base functions, and the method adds the base functions one by one, observing the correlation between the residue function and the candidate for the base function. The base functions do not need to be homogenous, i.e. to share the same formula. The method was experimentally verified and compared to neural networks, and the preliminary results were encouraging enough to develop the presented approach further.

Słowa kluczowe

EN

nonlinear approximation; parametric approximation model; incremental construction for the approximator; ICA; algorithm

PL

aproksymacja nieliniowa; model parametryczny; konstrukcja przyrostowa; algorytm

• Wydawca: Oficyna Wydawnicza Politechniki Warszawskiej
• Czasopismo: Prace Naukowe Politechniki Warszawskiej. Elektronika
• Rocznik: 2006
• Tom: z. 156
• Strony: 31--38
• Opis fizyczny: Bibliogr. 8 poz., tab.

Twórcy

autor

Arabas J.

autor

Dydyński A.

• Warsaw University of Technology, Institute of Electronic Systems, Warsaw, Poland,

Bibliografia

• [1] Ivakhnenko A.G.: Polynomial Theory of Complex Systems. IEEE Transactions on Systems, Man and Cybernetics, vol. SMC-1, no. 4, October 1971.
• [2] Prechelt L.: PROBEN1: A set of benchmarks and benchmarking rules for neural network training algorithms. Technical Report 21/94, Fakultät für Informatik, Universität Karlsruhe, Germany, 1994.
• [3] Nelder J.A., Mead R.: Computer Journal, vol. 7, 1965, pp. 308-313.
• [4] Fahlman S.E.: Faster learning variations on backpropagation: an empirical study. Proc. Connectionist Models Summer School, Morgan Kaufmann, 1988, pp. 38-51.
• [5] Hertz J., Krogh A., Palmer R.G.: Introduction to the Theory of Neural Computing. MIT Press, 1992.
• [6] Li Q., Tufts D.: Synthesizing neural networks by sequential addition of hidden modes. Proc. IEEE Int. Conf. on Neural Networks, 1994, pp. 708-713.
• [7] Riedmiller M., Braun H.: A direct adaptive method for faster backpropagation learning: The PROP algorithm. Proc. IEEE Int. Conf. on Neural Networks, 1993.
• [8] Biller B., Ghosh S.: Dependence modeling for stochastic simulation. Proc. 2004 Winter Simulation Conf., 2004.