Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Random Maximum 2 Satisfiability Logic in Discrete Hopfield Neural Network Incorporating Improved Election Algorithm
View through CrossRef
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.
Title: Random Maximum 2 Satisfiability Logic in Discrete Hopfield Neural Network Incorporating Improved Election Algorithm
Description:
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.
Related Results
Energy Based Logic Mining Analysis with Hopfield Neural Network for Recruitment Evaluation
Energy Based Logic Mining Analysis with Hopfield Neural Network for Recruitment Evaluation
An effective recruitment evaluation plays an important role in the success of companies, industries and institutions. In order to obtain insight on the relationship between factors...
Hopfield Lagrange Network for Economic Load Dispatch
Hopfield Lagrange Network for Economic Load Dispatch
In this chapter, a Hopfield Lagrange network (HLN) is proposed for solving economic load dispatch (ELD) problems. HLN is a combination of Lagrangian function and continuous Hopfiel...
On Hyperparameters Optimization of the Continuous Hopfield Network via Genetic Algorithm
On Hyperparameters Optimization of the Continuous Hopfield Network via Genetic Algorithm
Abstract
Recurrent neural networks have proven to be effective in various domains due to their ability to remember key information during solution processes. The continuous...
ELECTION CAMPAIGN: DEFINITION AND TEMPORAL BOUNDARIES
ELECTION CAMPAIGN: DEFINITION AND TEMPORAL BOUNDARIES
The subject. Detection of the essence of electoral process, the election campaign and their influence on the temporal component of the electoral process is the subject of this publ...
A History of Satisfiability
A History of Satisfiability
This chapter traces the links between the notion of Satisfiability and the attempts by mathematicians, philosophers, engineers, and scientists over the last 2300 years to develop e...
Bicomplex Projection Rule for Complex-Valued Hopfield Neural Networks
Bicomplex Projection Rule for Complex-Valued Hopfield Neural Networks
A complex-valued Hopfield neural network (CHNN) with a multistate activation function is a multistate model of neural associative memory. The weight parameters need a lot of memory...
MECHANISMS OF SCHEMATIC MODELING BASED ON VECTOR LOGIC
MECHANISMS OF SCHEMATIC MODELING BASED ON VECTOR LOGIC
Context. This paper addresses issues relevant to the EDA market – reducing the cost and time of testing and verification of digital projects by synthesizing the logic vector of a d...
Discrete Mutation Hopfield Neural Network in Propositional Satisfiability
Discrete Mutation Hopfield Neural Network in Propositional Satisfiability
The dynamic behaviours of an artificial neural network (ANN) system are strongly dependent on its network structure. Thus, the output of ANNs has long suffered from a lack of inter...