IDEAS home Printed from https://ideas.repec.org/a/igg/jamc00/v3y2012i3p1-19.html
   My bibliography  Save this article

G-HABC Algorithm for Training Artificial Neural Networks

Author

Listed:
  • Habib Shah

    (Universiti Tun Hussein Onn Malaysia, Malaysia)

  • Rozaida Ghazali

    (Universiti Tun Hussein Onn, Malaysia)

  • Nazri Mohd Nawi

    (Universiti Tun Hussein Onn, Malaysia)

  • Mustafa Mat Deris

    (Universiti Tun Hussein Onn Malaysia, Malaysia)

Abstract

Learning problems for Neural Network (NN) has widely been explored in the past two decades. Researchers have focused more on population-based algorithms because of its natural behavior processing. The population-based algorithms are Ant Colony Optimization (ACO), Artificial Bee Colony (ABC), and recently Hybrid Ant Bee Colony (HABC) algorithm produced an easy way for NN training. These social based techniques are mostly used for finding best weight values and over trapping local minima in NN learning. Typically, NN trained by traditional approach, namely the Backpropagation (BP) algorithm, has difficulties such as trapping in local minima and slow convergence. The new method named Global Hybrid Ant Bee Colony (G-HABC) algorithm which can overcome the gaps in BP is used to train the NN for Boolean Function classification task. The simulation results of the NN when trained with the proposed hybrid method were compared with that of Levenberg-Marquardt (LM) and ordinary ABC. From the results, the proposed G-HABC algorithm has shown to provide a better learning performance for NNs with reduced CPU time and higher success rates.

Suggested Citation

  • Habib Shah & Rozaida Ghazali & Nazri Mohd Nawi & Mustafa Mat Deris, 2012. "G-HABC Algorithm for Training Artificial Neural Networks," International Journal of Applied Metaheuristic Computing (IJAMC), IGI Global, vol. 3(3), pages 1-19, July.
  • Handle: RePEc:igg:jamc00:v:3:y:2012:i:3:p:1-19
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jamc.2012070101
    Download Restriction: no
    ---><---

    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:igg:jamc00:v:3:y:2012:i:3:p:1-19. 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    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.