Function approximations by superimposing genetic programming trees: with applications to engineering problems
type: Item
instance of: scholarly article
title: Function approximations by superimposing genetic programming trees: with applications to engineering problems
zbMATH Open document ID: 1147.68663
DOI: 10.1016/S0020-0255(99)00121-8
published in: Information Sciences
publication date: 2003-01-23T00:00:00Z
Mathematics Subject Classification ID: 68T05
zbMATH DE Number: 1858706
zbMATH Keywords: function approximation
zbMATH Keywords: genetic programming
zbMATH Keywords: linear associative memory
zbMATH Keywords: group of additive genetic programming trees
author: Y. S. Yeun
author: J.-C. Suh
author: Young Soon Yang
MaRDI profile type: Publication
cites work: Q4857377
cites work: An adaptive conjugate gradient learning algorithm for efficient training of neural networks
cites work: Q4845469
cites work: Q4845470
cites work: Self-organization and associative memory.
cites work: Q3996985
cites work: Linear and nonlinear associative memories for parameter estimation
cites work: Associative memory approach to the identification of structural and mechanical systems
cites work: Weighted linear associative memory approach to nonlinear parameter estimation
full work available at URL: s0020-0255(99)00121-8
OpenAlex ID: W2011592173
description: scientific article; zbMATH DE number 1858706