IDEAS home Printed from https://ideas.repec.org/a/wly/isacfm/v7y1998i2p69-79.html
   My bibliography  Save this article

Comparative performance of backpropagation networks designed by genetic algorithms and heuristics

Author

Listed:
  • James V. Hansen

Abstract

The design of neural network models involves numerous complexities, including the determination of input vectors, choosing the number of hidden layers and their computational units, and specifying activation functions for the latter. The combinatoric possibilities are daunting, yet experience has yielded informal guidelines that can be useful. Alternatively, current research on genetic algorithms (GA) suggests that they might be of practical use as a formal method of determining ‘good’ architectures for neural networks. In this paper, we use a genetic algorithm to find effective architectures for backpropagation neural networks (BP). We compare the performance of heuristically designed BP networks with that of GA‐designed BP networks. Our test domains are sets of problems having compensatory, conjunctive, and mixed‐decision structures. The results of our experiment suggest that heuristic methods produce architectures that are simpler and yet perform comparatively well. © 1998 John Wiley & Sons, Ltd.

Suggested Citation

  • James V. Hansen, 1998. "Comparative performance of backpropagation networks designed by genetic algorithms and heuristics," Intelligent Systems in Accounting, Finance and Management, John Wiley & Sons, Ltd., vol. 7(2), pages 69-79, June.
    • Handle: RePEc:wly:isacfm:v:7:y:1998:i:2:p:69-79
    DOI: 10.1002/(SICI)1099-1174(199806)7:23.0.CO;2-2
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/(SICI)1099-1174(199806)7:23.0.CO;2-2
    Download Restriction: no
    File URL: https://libkey.io/10.1002/(SICI)1099-1174(199806)7:23.0.CO;2-2?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:isacfm:v:7:y:1998:i:2:p:69-79. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: http://www.interscience.wiley.com/jpages/1099-1174/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.