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

Random Maximum 2 Satisfiability Logic in Discrete Hopfield Neural Network Incorporating Improved Election Algorithm

Author

Listed:
  • Vikneswari Someetheram

    (School of Mathematical Sciences, Universiti Sains Malaysia—USM, Gelugor 11800, Penang, Malaysia)

  • Muhammad Fadhil Marsani

    (School of Mathematical Sciences, Universiti Sains Malaysia—USM, Gelugor 11800, Penang, Malaysia)

  • Mohd Shareduwan Mohd Kasihmuddin

    (School of Mathematical Sciences, Universiti Sains Malaysia—USM, Gelugor 11800, Penang, Malaysia)

  • Nur Ezlin Zamri

    (School of Distance Education, Universiti Sains Malaysia—USM, Gelugor 11800, Penang, Malaysia)

  • Siti Syatirah Muhammad Sidik

    (School of Mathematical Sciences, Universiti Sains Malaysia—USM, Gelugor 11800, Penang, Malaysia)

  • Siti Zulaikha Mohd Jamaludin

    (School of Mathematical Sciences, Universiti Sains Malaysia—USM, Gelugor 11800, Penang, Malaysia)

  • Mohd. Asyraf Mansor

    (School of Distance Education, Universiti Sains Malaysia—USM, Gelugor 11800, Penang, Malaysia)

Abstract

Real life logical rule is not always satisfiable in nature due to the redundant variable that represents the logical formulation. Thus, the intelligence system must be optimally governed to ensure the system can behave according to non-satisfiable structure that finds practical applications particularly in knowledge discovery tasks. In this paper, we a propose non-satisfiability logical rule that combines two sub-logical rules, namely Maximum 2 Satisfiability and Random 2 Satisfiability, that play a vital role in creating explainable artificial intelligence. Interestingly, the combination will result in the negative logical outcome where the cost function of the proposed logic is always more than zero. The proposed logical rule is implemented into Discrete Hopfield Neural Network by computing the cost function associated with each variable in Random 2 Satisfiability. Since the proposed logical rule is difficult to be optimized during training phase of DHNN, Election Algorithm is implemented to find consistent interpretation that minimizes the cost function of the proposed logical rule. Election Algorithm has become the most popular optimization metaheuristic technique for resolving constraint optimization problems. The fundamental concepts of Election Algorithm are taken from socio-political phenomena which use new and efficient processes to produce the best outcome. The behavior of Random Maximum 2 Satisfiability in Discrete Hopfield Neural Network is investigated based on several performance metrics. The performance is compared between existing conventional methods with Genetic Algorithm and Election Algorithm. The results demonstrate that the proposed Random Maximum 2 Satisfiability can become the symbolic instruction in Discrete Hopfield Neural Network where Election Algorithm has performed as an effective training process of Discrete Hopfield Neural Network compared to Genetic Algorithm and Exhaustive Search.

Suggested Citation

  • Vikneswari Someetheram & Muhammad Fadhil Marsani & Mohd Shareduwan Mohd Kasihmuddin & Nur Ezlin Zamri & Siti Syatirah Muhammad Sidik & Siti Zulaikha Mohd Jamaludin & Mohd. Asyraf Mansor, 2022. "Random Maximum 2 Satisfiability Logic in Discrete Hopfield Neural Network Incorporating Improved Election Algorithm," Mathematics, MDPI, vol. 10(24), pages 1-29, December.
    • Handle: RePEc:gam:jmathe:v:10:y:2022:i:24:p:4734-:d:1002100
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/10/24/4734/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/10/24/4734/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Xu, Shaochuan & Wang, Xingyuan & Ye, Xiaolin, 2022. "A new fractional-order chaos system of Hopfield neural network and its application in image encryption," Chaos, Solitons & Fractals, Elsevier, vol. 157(C).
    2. Ilya Boykov & Vladimir Roudnev & Alla Boykova, 2022. "Stability of Solutions to Systems of Nonlinear Differential Equations with Discontinuous Right-Hand Sides: Applications to Hopfield Artificial Neural Networks," Mathematics, MDPI, vol. 10(9), pages 1-16, May.
    3. Hashim, Fatma A. & Houssein, Essam H. & Hussain, Kashif & Mabrouk, Mai S. & Al-Atabany, Walid, 2022. "Honey Badger Algorithm: New metaheuristic algorithm for solving optimization problems," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 192(C), pages 84-110.
    4. Liu, Xiaohan & Qu, Xiaobo & Ma, Xiaolei, 2021. "Improving flex-route transit services with modular autonomous vehicles," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 149(C).
    5. Aissi, Hassene & Bazgan, Cristina & Vanderpooten, Daniel, 2009. "Min-max and min-max regret versions of combinatorial optimization problems: A survey," European Journal of Operational Research, Elsevier, vol. 197(2), pages 427-438, September.
    Full references (including those not matched with items on IDEAS)

    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. Chassein, André & Dokka, Trivikram & Goerigk, Marc, 2019. "Algorithms and uncertainty sets for data-driven robust shortest path problems," European Journal of Operational Research, Elsevier, vol. 274(2), pages 671-686.
    2. Essam H. Houssein & Awny Sayed, 2023. "Dynamic Candidate Solution Boosted Beluga Whale Optimization Algorithm for Biomedical Classification," Mathematics, MDPI, vol. 11(3), pages 1-27, January.
    3. Rasool, Masrat & Belhaouari, Samir Brahim, 2023. "From Collatz Conjecture to chaos and hash function," Chaos, Solitons & Fractals, Elsevier, vol. 176(C).
    4. Zhang, Ziyuan & Wang, Jianzhou & Wei, Danxiang & Luo, Tianrui & Xia, Yurui, 2023. "A novel ensemble system for short-term wind speed forecasting based on Two-stage Attention-Based Recurrent Neural Network," Renewable Energy, Elsevier, vol. 204(C), pages 11-23.
    5. Deng, Quanli & Wang, Chunhua & Lin, Hairong, 2024. "Memristive Hopfield neural network dynamics with heterogeneous activation functions and its application," Chaos, Solitons & Fractals, Elsevier, vol. 178(C).
    6. Mohammad Javad Feizollahi & Igor Averbakh, 2014. "The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows," INFORMS Journal on Computing, INFORMS, vol. 26(2), pages 321-335, May.
    7. Chassein, André & Goerigk, Marc, 2018. "Compromise solutions for robust combinatorial optimization with variable-sized uncertainty," European Journal of Operational Research, Elsevier, vol. 269(2), pages 544-555.
    8. Jian Zhao & Bochen Zhang & Xiwang Guo & Liang Qi & Zhiwu Li, 2022. "Self-Adapting Spherical Search Algorithm with Differential Evolution for Global Optimization," Mathematics, MDPI, vol. 10(23), pages 1-31, November.
    9. Hegazy Rezk & A. G. Olabi & Mohammad Ali Abdelkareem & Abdul Hai Alami & Enas Taha Sayed, 2023. "Optimal Parameter Determination of Membrane Bioreactor to Boost Biohydrogen Production-Based Integration of ANFIS Modeling and Honey Badger Algorithm," Sustainability, MDPI, vol. 15(2), pages 1-13, January.
    10. Chassein, André & Goerigk, Marc & Kurtz, Jannis & Poss, Michael, 2019. "Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty," European Journal of Operational Research, Elsevier, vol. 279(2), pages 308-319.
    11. Lee, Enoch & Cen, Xuekai & Lo, Hong K., 2022. "Scheduling zonal-based flexible bus service under dynamic stochastic demand and Time-dependent travel time," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 168(C).
    12. Fatmah Y. Assiri & Mahmoud Ragab, 2023. "Optimal Deep-Learning-Based Cyberattack Detection in a Blockchain-Assisted IoT Environment," Mathematics, MDPI, vol. 11(19), pages 1-16, September.
    13. Eslami, N. & Yazdani, S. & Mirzaei, M. & Hadavandi, E., 2022. "Aphid–Ant Mutualism: A novel nature-inspired​ metaheuristic algorithm for solving optimization problems," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 201(C), pages 362-395.
    14. Zhang, Jiyu & Ge, Ying-En & Tang, Chunyan & Zhong, Meisu, 2024. "Optimising modular-autonomous-vehicle transit service employing coupling–decoupling operations plus skip-stop strategy," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 184(C).
    15. Hatzenbühler, Jonas & Jenelius, Erik & Gidófalvi, Gyözö & Cats, Oded, 2023. "Modular vehicle routing for combined passenger and freight transport," Transportation Research Part A: Policy and Practice, Elsevier, vol. 173(C).
    16. Mahamed G. H. Omran & Maurice Clerc & Fatme Ghaddar & Ahmad Aldabagh & Omar Tawfik, 2022. "Permutation Tests for Metaheuristic Algorithms," Mathematics, MDPI, vol. 10(13), pages 1-15, June.
    17. Muhyaddin Rawa & Abdullah Abusorrah & Yusuf Al-Turki & Martin Calasan & Mihailo Micev & Ziad M. Ali & Saad Mekhilef & Hussain Bassi & Hatem Sindi & Shady H. E. Abdel Aleem, 2022. "Estimation of Parameters of Different Equivalent Circuit Models of Solar Cells and Various Photovoltaic Modules Using Hybrid Variants of Honey Badger Algorithm and Artificial Gorilla Troops Optimizer," Mathematics, MDPI, vol. 10(7), pages 1-31, March.
    18. Kalaı¨, Rim & Lamboray, Claude & Vanderpooten, Daniel, 2012. "Lexicographic α-robustness: An alternative to min–max criteria," European Journal of Operational Research, Elsevier, vol. 220(3), pages 722-728.
    19. repec:wut:journl:v:2:y:2012:id:1022 is not listed on IDEAS
    20. Conde, Eduardo, 2012. "On a constant factor approximation for minmax regret problems using a symmetry point scenario," European Journal of Operational Research, Elsevier, vol. 219(2), pages 452-457.
    21. Bogusz Przybysławski & Adam Kasperski, 2012. "A computational study of approximation algorithms for a minmax resource allocation problem," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 22(2), pages 35-43.

    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:24:p:4734-:d:1002100. 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.