IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v319y2018icp31-47.html
   My bibliography  Save this article

Efficient methods of initializing neuron weights in self-organizing networks implemented in hardware

Author

Listed:
  • Kolasa, Marta
  • Długosz, Rafał
  • Talaśka, Tomasz
  • Pedrycz, Witold

Abstract

In this paper, we focus on the topic of an efficient initialization of neuron weights, which is one of key problems in artificial neural networks (ANNs). This problem is important in ANNs implemented as Application Specific Integrated Circuits (ASICs), in which the number of the weights is relatively large. When ANNs are implemented in software, the weights can be easily modified. In contrast, in neural networks realized as ASICs in which due to parallel data processing each neuron is realized as a separate circuit, it is necessary to provide programming and addressing lines to each memory cell containing a weight. This causes a substantial increase in the complexity of such systems. In this study, we performed comprehensive investigations, in which we simulated the training process of the Self-Organizing ANN with different initialization scenarios. The aim of these investigations was to find simple and efficient initialization procedures that lead to optimal learning process for a broad spectrum of values of other network parameters.

Suggested Citation

  • Kolasa, Marta & Długosz, Rafał & Talaśka, Tomasz & Pedrycz, Witold, 2018. "Efficient methods of initializing neuron weights in self-organizing networks implemented in hardware," Applied Mathematics and Computation, Elsevier, vol. 319(C), pages 31-47.
    • Handle: RePEc:eee:apmaco:v:319:y:2018:i:c:p:31-47
    DOI: 10.1016/j.amc.2017.01.043
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300317300619
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2017.01.043?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Kolasa, Marta & Talaska, Tomasz & Długosz, Rafał, 2015. "A novel recursive algorithm used to model hardware programmable neighborhood mechanism of self-organizing neural networks," Applied Mathematics and Computation, Elsevier, vol. 267(C), pages 314-328.
    2. Talaśka, Tomasz & Kolasa, Marta & Długosz, Rafał & Farine, Pierre-André, 2015. "An efficient initialization mechanism of neurons for Winner Takes All Neural Network implemented in the CMOS technology," Applied Mathematics and Computation, Elsevier, vol. 267(C), pages 119-138.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Marta Kolasa, 2020. "An Energy-Efficient, Parallel Neighborhood and Adaptation Functions for Hardware Implemented Self-Organizing Maps Applied in Smart Grid," Energies, MDPI, vol. 13(5), pages 1-25, March.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Talaśka, Tomasz & Długosz, Rafał, 2018. "Analog, parallel, sorting circuit for the application in Neural Gas learning algorithm implemented in the CMOS technology," Applied Mathematics and Computation, Elsevier, vol. 319(C), pages 218-235.
    2. Yu, Peilin & Deng, Feiqi & Sun, Yuanyuan & Wan, Fangzhe, 2022. "Stability analysis of impulsive stochastic delayed Cohen-Grossberg neural networks driven by Lévy noise," Applied Mathematics and Computation, Elsevier, vol. 434(C).

    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:eee:apmaco:v:319:y:2018:i:c:p:31-47. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.