Show simple item record

dc.contributor.authorWilliam C. Carpenter
dc.contributor.authorJean‐Francois Barthelemy
dc.date.accessioned2017-05-08T21:12:30Z
dc.date.available2017-05-08T21:12:30Z
dc.date.copyrightJuly 1994
dc.date.issued1994
dc.identifier.other%28asce%290887-3801%281994%298%3A3%28345%29.pdf
dc.identifier.urihttp://yetl.yabesh.ir/yetl/handle/yetl/42783
dc.description.abstractA current trend in scientific and engineering computing is to use neural‐network approximations instead of polynomial approximations or other types of approximations involving mathematical functions. A number of misconceptions have arisen concerning neural networks as approximators. This paper eliminates these misconceptions. In so doing, the paper examines the computational efficiency of neural‐network approximations compared to polynomial approximations, examines the effect of using underdetermined neural‐network approximations, examines the effect of design point selection on the quality of neural‐network approximations, and examines the computing time required to train neural networks compared to the time to develop polynomial approximations.
dc.publisherAmerican Society of Civil Engineers
dc.titleCommon Misconceptions about Neural Networks as Approximators
dc.typeJournal Paper
dc.journal.volume8
dc.journal.issue3
dc.journal.titleJournal of Computing in Civil Engineering
dc.identifier.doi10.1061/(ASCE)0887-3801(1994)8:3(345)
dc.treeJournal of Computing in Civil Engineering:;1994:;Volume ( 008 ):;issue: 003
dc.contenttypeFulltext


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record