Nurhafizah Moziyana Mohd Yusop

Nurhafizah Moziyana Mohd Yusop

Auto-generated profile, based on publicly available information

Nurhafizah Moziyana Mohd Yusop

Faculty of Defence Science and Technology, National Defence University of Malaysia, Kuala Lumpur, Malaysia

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2017 in AIP Conference Proceedings
Verified
Conference Paper
Closed access
NYNurhafizah Moziyana Mohd Yusop
Nurhafizah Moziyana Mohd Yusop
MHMohammad Khatim Hasan
Mohammad Khatim Hasan
MWMuslihah Wook
Muslihah Wook
MAMohd Fahmi Mohamad Amran
Mohd Fahmi Mohamad Amran
SASiti Rohaidah Ahmad
Siti Rohaidah Ahmad
There are many benefits to improve Euler scheme for solving the Ordinary Differential Equation Problems. Among the benefits are simple implementation and low-cost computational. However, the problem of accuracy in Euler scheme persuade scholar to use complex method. Therefore, the main purpose of this research are show the construction a new modified Euler scheme that improve accuracy of Polygon scheme in various step size. The implementing of new scheme are used Polygon scheme and Harmonic mean concept that called as Harmonic-Polygon scheme. This Harmonic-Polygon can provide new advantages that Euler scheme could offer by solving Ordinary Differential Equation problem. Four set of problems are solved via Harmonic-Polygon. Findings show that new scheme or Harmonic-Polygon scheme can produce much better accuracy result.

1 January 2017 in AIP Conference Proceedings
Verified
Conference Paper
Closed access
SASiti Rohaidah Ahmad
Siti Rohaidah Ahmad
NYNurhafizah Moziyana Mohd Yusop
Nurhafizah Moziyana Mohd Yusop
ABAzuraliza Abu Bakar
Azuraliza Abu Bakar
MYMohd Ridzwan Yaakub
Mohd Ridzwan Yaakub
This research paper aims to propose a hybrid of ant colony optimization (ACO) and k-nearest neighbor (KNN) algorithms as feature selections for selecting and choosing relevant features from customer review datasets. Information gain (IG), genetic algorithm (GA), and rough set attribute reduction (RSAR) were used as baseline algorithms in a performance comparison with the proposed algorithm. This paper will also discuss the significance test, which was used to evaluate the performance differences between the ACO-KNN, IG-GA, and IG-RSAR algorithms. This study evaluated the performance of the ACO-KNN algorithm using precision, recall, and F-score, which were validated using the parametric statistical significance tests. The evaluation process has statistically proven that this ACO-KNN algorithm has been significantly improved compared to the baseline algorithms. The evaluation process has statistically proven that this ACO-KNN algorithm has been significantly improved compared to the baseline algorithms. In addition, the experimental results have proven that the ACO-KNN can be used as a feature selection technique in sentiment analysis to obtain quality, optimal feature subset that can represent the actual data in customer review data.

1 January 2015 in Lecture Notes on Software Engineering
Verified
Journal Article
Closed access
NYN. M. M. Yusop
N. M. M. Yusop
MHM. K. Hasan
M. K. Hasan
MRM. Rahmat
M. Rahmat
UMUniversiti Kebangsaan Malaysia
Universiti Kebangsaan Malaysia

5 July 2022
Verified
Book Chapter
Closed access
PDF file
NNNurul Natasha Awinda Mohammad Nizam
Nurul Natasha Awinda Mohammad Nizam
MAMohd Fahmi Mohamad Amran
Mohd Fahmi Mohamad Amran
NYNurhafizah Moziyana Mohd Yusop
Nurhafizah Moziyana Mohd Yusop
SASiti Rohaidah Ahmad
Siti Rohaidah Ahmad
NWNorshahriah Abdul Wahab
Norshahriah Abdul Wahab

19 December 2024 in IEEE Access
Verified
Journal Article
Open access
YRYanjie Ren
Yanjie Ren
AZAZLAN Mohd MOHD ZAIN
AZLAN Mohd MOHD ZAIN
YZYan Zhang
Yan Zhang
RJRozita Abdul Jalil
Rozita Abdul Jalil
MBMAHADI BAHARI
MAHADI BAHARI
NYNurhafizah Moziyana Mohd Yusop
Nurhafizah Moziyana Mohd Yusop
Genetic and genomic variations are primary drivers of tumor development. Identifying driver genes from numerous passenger genes across pan-cancer poses a significant challenge due to varying mutation loads. While independent studies have elucidated cancer-associated mutation patterns within specific cancer types, a systematic approach to integrating these mutation data for assessing the impact of gene mutations has been lacking. This study addresses this gap by integrating pan-cancer genomic somatic mutation data and introducing a novel mutation weight fusion (WeiFu) score calculation method. WeiFu computes frequency and weighted fusion scores by cancer type, facilitating the identification of potential driver genes. Evaluation results on an integrated pan-cancer dataset comprising 29 different cancer types demonstrate that WeiFu significantly outperforms current well-known approaches in prediction accuracy, sensitivity, and specificity. Notably, WeiFu recovers 277 known cancer genes among the top 500 ranked candidates and successfully identifies potential driver genes supported by strong evidence. Consequently, WeiFu shows considerable promise for identifying driver genes within the rapidly expanding corpus of cancer genomic data.

30 June 2020 in Journal of Defence Science, Engineering & Technology
Verified
Journal Article
Open access
PDF file
NYNurhafizah Moziyana Mohd Yusop
Nurhafizah Moziyana Mohd Yusop
NSNooraida Samsudin
Nooraida Samsudin
AMAnis Shahida Mokhtar
Anis Shahida Mokhtar
SASiti Rohaidah Ahmad
Siti Rohaidah Ahmad
ABAslina Baharum
Aslina Baharum
MAMohd Fahmi Mohammad Amran
Mohd Fahmi Mohammad Amran
Euler method is a numerical order process for solving problems with the Ordinary Differential Equation (ODE). It is a fast and easy way. While Euler offers a simple procedure for solving ODEs, problems such as complexity, processing time and accuracy have driven others to use more sophisticated methods. Improvements to the Euler method have attracted much attention resulting in numerous modified Euler methods. This paper proposes Cube Polygon, a modified Euler method with improved accuracy and complexity. In order to demonstrate the accuracy and easy implementation of the proposed method, several examples are presented. Cube Polygon’s performance was compared to Polygon’s scheme and evaluated against exact solutions using SCILAB. Results indicate that not only Cube Polygon has produced solutions that are close to identical solutions for small step sizes, but also for higher step sizes, thus generating more accurate results and decrease complexity. Also known in this paper is the general of the RL circuit due to the ODE problem.