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

A Novel Multi-Objective Hybrid Election Algorithm for Higher-Order Random Satisfiability in Discrete Hopfield Neural Network

Author

Listed:
  • Syed Anayet Karim

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

  • Mohd Shareduwan Mohd Kasihmuddin

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

  • Saratha Sathasivam

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

  • Mohd. Asyraf Mansor

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

  • Siti Zulaikha Mohd Jamaludin

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

  • Md Rabiol Amin

    (Department of Computer Science and Engineering, CCN University of Science and Technology, Cumilla 3503, Bangladesh)

Abstract

Hybridized algorithms are commonly employed to improve the performance of any existing method. However, an optimal learning algorithm composed of evolutionary and swarm intelligence can radically improve the quality of the final neuron states and has not received creative attention yet. Considering this issue, this paper presents a novel metaheuristics algorithm combined with several objectives—introduced as the Hybrid Election Algorithm (HEA)—with great results in solving optimization and combinatorial problems over a binary search space. The core and underpinning ideas of this proposed HEA are inspired by socio-political phenomena, consisting of creative and powerful mechanisms to achieve the optimal result. A non-systematic logical structure can find a better phenomenon in the study of logic programming. In this regard, a non-systematic structure known as Random k Satisfiability (RAN k SAT) with higher-order is hosted here to overcome the interpretability and dissimilarity compared to a systematic, logical structure in a Discrete Hopfield Neural Network (DHNN). The novelty of this study is to introduce a new multi-objective Hybrid Election Algorithm that achieves the highest fitness value and can boost the storage capacity of DHNN along with a diversified logical structure embedded with RAN k SAT representation. To attain such goals, the proposed algorithm tested four different types of algorithms, such as evolutionary types (Genetic Algorithm (GA)), swarm intelligence types (Artificial Bee Colony algorithm), population-based (traditional Election Algorithm (EA)) and the Exhaustive Search (ES) model. To check the performance of the proposed HEA model, several performance metrics, such as training–testing, energy, similarity analysis and statistical analysis, such as the Friedman test with convergence analysis, have been examined and analyzed. Based on the experimental and statistical results, the proposed HEA model outperformed all the mentioned four models in this research.

Suggested Citation

  • Syed Anayet Karim & Mohd Shareduwan Mohd Kasihmuddin & Saratha Sathasivam & Mohd. Asyraf Mansor & Siti Zulaikha Mohd Jamaludin & Md Rabiol Amin, 2022. "A Novel Multi-Objective Hybrid Election Algorithm for Higher-Order Random Satisfiability in Discrete Hopfield Neural Network," Mathematics, MDPI, vol. 10(12), pages 1-41, June.
    • Handle: RePEc:gam:jmathe:v:10:y:2022:i:12:p:1963-:d:833205
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Ahmed Albatineh & Magdalena Niewiadomska-Bugaj, 2011. "Correcting Jaccard and other similarity indices for chance agreement in cluster analysis," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 5(3), pages 179-200, October.
    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. Radu LIXANDROIU & Catalin MAICAN, 2014. "A Model for Comparing Free Cloud Platforms," Informatica Economica, Academy of Economic Studies - Bucharest, Romania, vol. 18(4), pages 40-49.
    2. Antonio D’Ambrosio & Sonia Amodio & Carmela Iorio & Giuseppe Pandolfo & Roberta Siciliano, 2021. "Adjusted Concordance Index: an Extensionl of the Adjusted Rand Index to Fuzzy Partitions," Journal of Classification, Springer;The Classification Society, vol. 38(1), pages 112-128, April.
    3. Daniel Baier & Ines Daniel & Sarah Frost & Robert Naundorf, 2012. "Image data analysis and classification in marketing," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 6(4), pages 253-276, December.
    4. Isabella Morlini & Sergio Zani, 2012. "Dissimilarity and similarity measures for comparing dendrograms and their applications," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 6(2), pages 85-105, July.

    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:12:p:1963-:d:833205. 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.