Nur' Afifah Rusdi
Thumbnail Image
Preferred name
Nur' Afifah Rusdi
Official Name
Nur' Afifah, Rusdi
Alternative Name
Rusdi, N. A.
Rusdi, Nur'Afifah
Main Affiliation
Scopus Author ID
56862208900

Research Output

Filters

2 1
2
1 1
Reset filters

Settings
Now showing 1 - 2 of 2
  • Publication
    Multi-unit discrete hopfield neural network for higher order supervised learning through logic mining: optimal performance design and attribute selection
    (Springer/King Saud University, 2023)
    Nur' Afifah Rusdi
    ;
    Mohd Shareduwan Mohd Kasihmuddin
    ;
    Nurul Atiqah Romli
    ;
    Gaeithry Manoharam
    ;
    Mohd. Asyraf Mansor
    In the perspective of logic mining, the attribute selection, and the objective function of the best logic is the two main factors that identifies the effectiveness of our proposed logic mining model. The non-significant attributes selected will cause the Discrete Hopfield Neural Network to learned and obtain wrong synaptic weight. Thus, this will result to suboptimal solution. Although we might select the correct attributes, the conventional objective function of the best logic limits the search space to obtained more induced logic during the retrieval phase of Discrete Hopfield Neural Network. Therefore, this paper proposes a novel logic mining by integrating statistical analysis in the pre-processing phase to ensure that only optimal attributes will be selected. Supervised learning approach via correlation analysis is implemented for the purpose of attribute selection. Additionally, permutation operator serves to enhance the probability of the higher order satisfiability logical rule to be satisfied by having finite arrangement of attributes. During the learning phase, we proposed multi-unit Discrete Hopfield Neural Network to enhance the search space which leads to optimal solution. The efficiency of the proposed model is tested on 15 real-life datasets by comparing the performance of the model with existing works in logic mining using five performance metrics including accuracy, sensitivity, precision, Matthews Correlation Coefficient (MCC) and F1 Score. According to the results, the proposed model has its own strength by dominating most of the average rank of the performance metrics. This demonstrates that the proposed model can differentiate across all domains in the confusion matrix. Additionally, the p-value obtained based on the five-performance metrics indicate that there is a significantly difference between the proposed model and all existing works since the value obtained for accuracy (0.000), sensitivity (0.001), precision (0.000), F1 score (0.000) and MCC (0.000) are less than 0.05. This finding statistically prove that the proposed model is more effective compared with existing works in logic mining.
  • Publication
    Artificial bee colony for curve reconstruction using quartic bézier
    (Little Lion Scientific, 2022-03-31)
    Nur' Afifah Rusdi
    ;
    Zainor Ridzuan Yahya
    ;
    Wan Zuki Azman Wan Muhamad
    ;
    Nurshazneem Roslan
    This work presents the use of Artificial Bee Colony Algorithm (ABC) for curve reconstruction using Quartic Bézier. Quartic Bézier curve is rarely used by the researchers in the application of medical images. Therefore, by increasing the degree of the Bézier curve, a better curve with small error can be obtain. The process of curve reconstruction involved was boundary and corner point detection of the medical image, parameterization and curve reconstruction by using ABC. By applying these processes, the fitted Quartic Bézier is obtained. The Sum Square Error (SSE) is used to record the error between the fitted Quartic Bézier curve with the original image. The results of SSE is recorded after the process is repeated 10 times with the average error of 3.4463e03 . Because the final output of the fitted curve resembles the original image, the suggested method can be considered as an option method for curve reconstruction applications. ABC algorithm is an interesting algorithm that can be explored in more detail and can be applied in various problems.
      3  10