S-Type Random k Satisfiability Logic in Discrete Hopfield Neural Network Using Probability Distribution: Performance Optimization and Analysis
Author
Abstract
Suggested Citation
Download full text from publisher
References listed on IDEAS
- 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.
- Mohd Shareduwan Mohd Kasihmuddin & Siti Zulaikha Mohd Jamaludin & Mohd. Asyraf Mansor & Habibah A. Wahab & Siti Maisharah Sheikh Ghadzi, 2022. "Supervised Learning Perspective in Logic Mining," Mathematics, MDPI, vol. 10(6), pages 1-35, March.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Abdellah Chehri & Francois Rivest, 2023. "Editorial for the Special Issue “Advances in Machine Learning and Mathematical Modeling for Optimization Problems”," Mathematics, MDPI, vol. 11(8), pages 1-5, April.
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.- 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.
- Gaeithry Manoharam & Mohd Shareduwan Mohd Kasihmuddin & Siti Noor Farwina Mohamad Anwar Antony & Nurul Atiqah Romli & Nur ‘Afifah Rusdi & Suad Abdeen & Mohd. Asyraf Mansor, 2023. "Log-Linear-Based Logic Mining with Multi-Discrete Hopfield Neural Network," Mathematics, MDPI, vol. 11(9), pages 1-30, April.
More about this item
Keywords
discrete hopfield neural network; non-systematic satisfiability; probability distribution; binomial distribution; statistical learning; optimization problems; travelling salesman problem; evolutionary computation;All these keywords.
Statistics
Access and download statisticsCorrections
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:11:y:2023:i:4:p:984-:d:1069210. 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.