IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v10y2022i7p1129-d785128.html
   My bibliography  Save this article

Non-Systematic Weighted Satisfiability in Discrete Hopfield Neural Network Using Binary Artificial Bee Colony Optimization

Author

Listed:
  • Siti Syatirah Muhammad Sidik

    (School of Mathematical Sciences, Universiti Sains Malaysia, USM, Pulau Pinang 11800, Malaysia)

  • Nur Ezlin Zamri

    (School of Distance Education, Universiti Sains Malaysia, USM, Pulau Pinang 11800, Malaysia)

  • Mohd Shareduwan Mohd Kasihmuddin

    (School of Mathematical Sciences, Universiti Sains Malaysia, USM, Pulau Pinang 11800, Malaysia)

  • Habibah A. Wahab

    (School of Pharmaceutical Sciences, Universiti Sains Malaysia, USM, Pulau Pinang 11800, Malaysia)

  • Yueling Guo

    (School of Mathematical Sciences, Universiti Sains Malaysia, USM, Pulau Pinang 11800, Malaysia)

  • Mohd. Asyraf Mansor

    (School of Distance Education, Universiti Sains Malaysia, USM, Pulau Pinang 11800, Malaysia)

Abstract

Recently, new variants of non-systematic satisfiability logic were proposed to govern Discrete Hopfield Neural Network. This new variant of satisfiability logical rule will provide flexibility and enhance the diversity of the neuron states in the Discrete Hopfield Neural Network. However, there is no systematic method to control and optimize the logical structure of non-systematic satisfiability. Additionally, the role of negative literals was neglected, reducing the expressivity of the information that the logical structure holds. This study proposed an additional optimization layer of Discrete Hopfield Neural Network called the logic phase that controls the distribution of negative literals in the logical structure. Hence, a new variant of non-systematic satisfiability named Weighted Random 2 Satisfiability was formulated. Thus, a proposed searching technique called the binary Artificial Bee Colony algorithm will ensure the correct distribution of the negative literals. It is worth mentioning that the binary Artificial Bee Colony has flexible and less free parameters where the modifications tackled on the objective function. Specifically, this study utilizes a binary Artificial Bee Colony algorithm by modifying the updating rule equation by using not and (NAND) logic gate operator. The performance of the binary Artificial Bee Colony will be compared with other variants of binary Artificial Bee Colony algorithms of different logic gate operators and conventional binary algorithms such as the Particle Swarm Optimization, Exhaustive Search, and Genetic Algorithm. The experimental results and comparison show that the proposed algorithm is compatible in finding the correct logical structure according to the initiate ratio of negative literal.

Suggested Citation

  • Siti Syatirah Muhammad Sidik & Nur Ezlin Zamri & Mohd Shareduwan Mohd Kasihmuddin & Habibah A. Wahab & Yueling Guo & Mohd. Asyraf Mansor, 2022. "Non-Systematic Weighted Satisfiability in Discrete Hopfield Neural Network Using Binary Artificial Bee Colony Optimization," Mathematics, MDPI, vol. 10(7), pages 1-27, April.
  • Handle: RePEc:gam:jmathe:v:10:y:2022:i:7:p:1129-:d:785128
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/10/7/1129/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/10/7/1129/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Suthida Fairee & Santitham Prom-On & Booncharoen Sirinaovakul, 2018. "Reinforcement learning for solution updating in Artificial Bee Colony," PLOS ONE, Public Library of Science, vol. 13(7), pages 1-38, July.
    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. Ju Chen & Yuan Gao & Mohd Shareduwan Mohd Kasihmuddin & Chengfeng Zheng & Nurul Atiqah Romli & Mohd. Asyraf Mansor & Nur Ezlin Zamri & Chuanbiao When, 2024. "MTS-PRO2SAT: Hybrid Mutation Tabu Search Algorithm in Optimizing Probabilistic 2 Satisfiability in Discrete Hopfield Neural Network," Mathematics, MDPI, vol. 12(5), pages 1-40, February.
    2. Suad Abdeen & Mohd Shareduwan Mohd Kasihmuddin & Nur Ezlin Zamri & Gaeithry Manoharam & Mohd. Asyraf Mansor & Nada Alshehri, 2023. "S-Type Random k Satisfiability Logic in Discrete Hopfield Neural Network Using Probability Distribution: Performance Optimization and Analysis," Mathematics, MDPI, vol. 11(4), pages 1-46, February.

    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.

      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:gam:jmathe:v:10:y:2022:i:7:p:1129-:d:785128. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.