Multi-objective Hybrid Election Algorithm For Random K Satisfiability In Discrete Hopfield Neural Network

In the current Artificial Neural Network research development, symbolic logical structure plays a vital role for describing the concept of intelligence. The existing Discrete Hopfield Neural Network with systematic Satisfiability logical structures failed to produce non-repetitive final neuron st...

Full description

Bibliographic Details
Main Author: Karim, Syed Anayet
Format: Thesis
Language:English
Published: 2023
Subjects:
Online Access:http://eprints.usm.my/60766/1/SYED%20ANAYET%20KARIM%20-%20TESIS24.pdf
_version_ 1825908343552606208
author Karim, Syed Anayet
author_facet Karim, Syed Anayet
author_sort Karim, Syed Anayet
collection USM
description In the current Artificial Neural Network research development, symbolic logical structure plays a vital role for describing the concept of intelligence. The existing Discrete Hopfield Neural Network with systematic Satisfiability logical structures failed to produce non-repetitive final neuron states which tends to local minima solutions. In this regard, this thesis proposed non-systematic Random k Satisfiability logic for 3 k  , where k generates maximum three types of logical combinations (k=1,3; k=2,3; k=1,2,3) to report the behaviours of higher-order multiple logical structures. To analyse the logical combinations of Random k Satisfiability, this thesis will conduct experimentations with several performance metrics. The analysis revealed that the k=2,3 combination of Random k Satisfiability has more consistent interpretation and global solutions compared to the other combinations. Moreover, the optimal performance of Random k Satisfiability logic can be achieved by applying an efficient algorithm during the training phase of Discrete Hopfield Neural Network. One of the major features of an efficient algorithm is to make a proper balance in the exploration and exploitation strategy. In this regard, this thesis proposed a hybridized algorithm named Hybrid Election Algorithm that can well maintain the exploration-exploitation strategy.
first_indexed 2024-09-25T03:57:10Z
format Thesis
id usm.eprints-60766
institution Universiti Sains Malaysia
language English
last_indexed 2024-09-25T03:57:10Z
publishDate 2023
record_format dspace
spelling usm.eprints-607662024-06-27T04:48:42Z http://eprints.usm.my/60766/ Multi-objective Hybrid Election Algorithm For Random K Satisfiability In Discrete Hopfield Neural Network Karim, Syed Anayet QA1-939 Mathematics In the current Artificial Neural Network research development, symbolic logical structure plays a vital role for describing the concept of intelligence. The existing Discrete Hopfield Neural Network with systematic Satisfiability logical structures failed to produce non-repetitive final neuron states which tends to local minima solutions. In this regard, this thesis proposed non-systematic Random k Satisfiability logic for 3 k  , where k generates maximum three types of logical combinations (k=1,3; k=2,3; k=1,2,3) to report the behaviours of higher-order multiple logical structures. To analyse the logical combinations of Random k Satisfiability, this thesis will conduct experimentations with several performance metrics. The analysis revealed that the k=2,3 combination of Random k Satisfiability has more consistent interpretation and global solutions compared to the other combinations. Moreover, the optimal performance of Random k Satisfiability logic can be achieved by applying an efficient algorithm during the training phase of Discrete Hopfield Neural Network. One of the major features of an efficient algorithm is to make a proper balance in the exploration and exploitation strategy. In this regard, this thesis proposed a hybridized algorithm named Hybrid Election Algorithm that can well maintain the exploration-exploitation strategy. 2023-08 Thesis NonPeerReviewed application/pdf en http://eprints.usm.my/60766/1/SYED%20ANAYET%20KARIM%20-%20TESIS24.pdf Karim, Syed Anayet (2023) Multi-objective Hybrid Election Algorithm For Random K Satisfiability In Discrete Hopfield Neural Network. PhD thesis, Universiti Sains Malaysia.
spellingShingle QA1-939 Mathematics
Karim, Syed Anayet
Multi-objective Hybrid Election Algorithm For Random K Satisfiability In Discrete Hopfield Neural Network
title Multi-objective Hybrid Election Algorithm For Random K Satisfiability In Discrete Hopfield Neural Network
title_full Multi-objective Hybrid Election Algorithm For Random K Satisfiability In Discrete Hopfield Neural Network
title_fullStr Multi-objective Hybrid Election Algorithm For Random K Satisfiability In Discrete Hopfield Neural Network
title_full_unstemmed Multi-objective Hybrid Election Algorithm For Random K Satisfiability In Discrete Hopfield Neural Network
title_short Multi-objective Hybrid Election Algorithm For Random K Satisfiability In Discrete Hopfield Neural Network
title_sort multi objective hybrid election algorithm for random k satisfiability in discrete hopfield neural network
topic QA1-939 Mathematics
url http://eprints.usm.my/60766/1/SYED%20ANAYET%20KARIM%20-%20TESIS24.pdf
work_keys_str_mv AT karimsyedanayet multiobjectivehybridelectionalgorithmforrandomksatisfiabilityindiscretehopfieldneuralnetwork