.png){kind=icon}
.png){kind=icon}
Return
Symbolic function network
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neunet.2009.02.003.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper a model called symbolic function network (SFN) is introduced: that is based on using elementary functions (for example powers, the exponential function, and the logarithm) as building blocks. The proposed method uses these building blocks to synthesize a function that best fits the training data in a regression framework. The resulting network is of the form of a tree, where adding nodes horizontally means having a summation of elementary functions and adding nodes vertically means concatenating elementary functions. Several new algorithms were proposed to construct the tree based on the concepts of forward greedy search and backward greedy search, together with applying the steepest descent concept. The method is tested on a number of examples and it is shown to exhibit good performance. (C) 2009 Elsevier Ltd. All rights reserved.
Keywords:
Symbolic networks
Multilayer networks
Tree networks
Neural tree
Symbolic functions
Computer algebra
Tree propagation
Forward greedy search
Backward greedy search
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.3
Papers:
7.8K
Citations:
3.0W