Publications
Sort:
Open Access Research Article Issue
A major random 1,3-satisfiability logic mining model in discrete Hopfield neural networks for adverse event analysis
AIMS Mathematics 2026, 11(6): 18081-18121
Published: 15 June 2026
Abstract PDF (1.7 MB) Collect
Downloads:15

Logic mining in neural networks enables the extracting of interpretable symbolic knowledge from complex datasets. This study proposes a logic mining approach in discrete Hopfield neural networks based on a non-systematic major random 1,3-satisfiability (MR1,3SAT) logical structure for adverse event analysis in Alzheimer's disease datasets. The proposed model incorporates first- and third-order logical clauses to enhance representational flexibility while maintaining computational tractability. A feature selection mechanism based on Jaccard analysis is incorporated to identify relevant attributes, while the intelligent artificial bee colony algorithm is applied during the retrieval phase to refine the final neuron states. Experimental evaluation on Alzheimer's disease neuroimaging initiative datasets demonstrate that the proposed model achieves superior performance compared with existing logic mining approaches, obtaining 90.23% accuracy, 98% sensitivity, 99% specificity, and a Fowlkes-Mallows index of 93.46%. These results indicate that the MR1,3SAT-based logic mining model improves both interpretability and classification reliability for adverse event symptoms analysis in Alzheimer's disease neuroimaging initiative datasets.

Open Access Research Article Issue
Higher order Weighted Random k Satisfiability ( k = 1 , 3) in Discrete Hopfield Neural Network
AIMS Mathematics 2025, 10(1): 159-194
Published: 15 January 2025
Abstract PDF (1.9 MB) Collect
Downloads:20

Researchers have explored various non-systematic satisfiability approaches to enhance the interpretability of Discrete Hopfield Neural Networks. A flexible framework for non-systematic satisfiability has been developed to investigate diverse logical structures across dimensions and has improved the lack of neuron variation. However, the logic phase of this approach tends to overlook the distribution and characteristics of literal states, and the ratio of negative literals has not been mentioned with higher-order clauses. In this paper, we propose a new non-systematic logic named Weighted Random k Satisfiability ( k = 1 , 3), which implements the ratio of negative literals in higher-order clauses. The proposed logic, integrated into the Discrete Hopfield Neural Network, established a logical structure by incorporating the ratio of negative literals during the logic phase. This enhancement increased the network's storage capacity, improving its ability to handle complex, high-dimensional problems. The advanced logic was evaluated in the learning phase by various metrics. When the values of the ratio were r = 0.2, 0.4, 0.6, and 0.8, the logic demonstrated the potential for better performances and smaller errors. Furthermore, the performance of the proposed logical structure demonstrated a positive impact on the management of synaptic weights. The results indicated that the optimal global minimum solutions are achieved when the ratio of negative literals was set to r = 0.8. Compared to the state-of-the-art logical structures, this novel approach has a more significant impact on achieving global minimum solutions, particularly in terms of the ratio of negative literals.

Total 2