Nurhafizah Moziyana Mohd Yusop
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Nurhafizah Moziyana Mohd Yusop has a total of 25 co-authors. Here are the top co-authors by number of shared publications:
- Siti Rohaidah Ahmad
Universiti Pertahanan Nasional Malaysia, Kem Perdana Sungai Besi
3 shared publications - Mohd Fahmi Mohamad Amran
Faculty of Defense Science & Technology National Defense University of Malaysia Kuala Lumpur Malaysia
2 shared publications Anis Shahida Mokhtar
1 shared publicationAslina Baharum
Faculty of Computing and Informatics Level
1 shared publication- Azlan Mohd Zain
Faculty of Computing, Universiti Teknologi Malaysia, Skudai, Malaysia
1 shared publication - Azurah A. Samah
Universiti Teknologi Malaysia
1 shared publication
Latest Publications
- Open Access
- 19 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 194762-194773
WeiFu: A Novel Pan-Cancer Driver Gene Identification Method Using Incidence-Weighted Mutation Scores
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.
- 19 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 194762-194773
Open AccessWeiFu: A Novel Pan-Cancer Driver Gene Identification Method Using Incidence-Weighted Mutation Scores
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.
- 5 July 2022
- Published by Springer Nature
- p. 469-477
The Development of Electroencephalogram (EEG) in Neuromarketing Using Hedonic and Utilitarian Motivation
- 5 July 2022
- Published by Springer Nature
- p. 469-477
The Development of Electroencephalogram (EEG) in Neuromarketing Using Hedonic and Utilitarian Motivation
- Open Access
- 30 June 2020
- Published by National Defence University of Malaysia in Journal of Defence Science, Engineering & Technology
- Vol. 3 (1)
CUBE POLYGON: A NEW MODIFIED EULER METHOD TO IMPROVE ELECTRIC CIRCUIT EFFICIENCY
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.
- 30 June 2020
- Published by National Defence University of Malaysia in Journal of Defence Science, Engineering & Technology
- Vol. 3 (1)
Open AccessCUBE POLYGON: A NEW MODIFIED EULER METHOD TO IMPROVE ELECTRIC CIRCUIT EFFICIENCY
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.
- 1 January 2017
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 1891, 020018
Statistical analysis for validating ACO-KNN algorithm as feature selection in sentiment analysis
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 2017
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 1891, 020018
Statistical analysis for validating ACO-KNN algorithm as feature selection in sentiment analysis
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 2017
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 1891, 020102
A new Euler scheme based on harmonic-polygon approach for solving first order ordinary differential equation
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
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 1891, 020102
A new Euler scheme based on harmonic-polygon approach for solving first order ordinary differential equation
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 2015
- Published by EJournal Publishing in Lecture Notes on Software Engineering
- Vol. 3 (3) , 199-202
Comparison New Algorithm Modified Euler in Ordinary Differential Equation Using Scilab Programming
- 1 January 2015
- Published by EJournal Publishing in Lecture Notes on Software Engineering
- Vol. 3 (3) , 199-202
Comparison New Algorithm Modified Euler in Ordinary Differential Equation Using Scilab Programming