Khalil Al-Wagih
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Khalil Al-Wagih has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Ebrahim Mohammed Senan
Department of Artificial Intelligence, Faculty of Computer Science and Information Technology, Al-Razi University, Sana’a, Yemen
4 shared publications - Ahmed Khalid
Computer Department, Applied College, Najran University, Najran 66462, Saudi Arabia
2 shared publications - Mamoun Mohammad Ali Al-Azzam
Computer Department, Applied College, Najran University, Najran 66462, Saudi Arabia
2 shared publications - Ziad Mohammad Alkhraisha
Computer Department, Applied College, Najran University, Najran 66462, Saudi Arabia
2 shared publications Ali Mohammed Mohammed Al-Rakhami
Department of Computer Science, Faculty of Computer Science & Informatics, Thamar University, Dhamar, Yemen
1 shared publication- Basheer Ameen Raddwan
Department of Information Technology, Faculty of Computer Science and IT, Sanaa University, Sanaa, Yemen
1 shared publication
Latest Publications
- 7 September 2026
- Published by Springer Nature in Earth Science Informatics
- Vol. 19 (10) , 180
Interpretable hybrid digital image analysis model with fuzzy logic system for porosity estimation in clay-influenced sandstone reservoirs
- 7 September 2026
- Published by Springer Nature in Earth Science Informatics
- Vol. 19 (10) , 180
Interpretable hybrid digital image analysis model with fuzzy logic system for porosity estimation in clay-influenced sandstone reservoirs
- Open Access
- 13 June 2026
- Published by Springer Nature in Scientific Reports
- Vol. 16 (1)
Efficient and interpretable maximal frequent fuzzy pattern mining with multi phase pruning and ternary search
The exponential growth of quantitative data across various domains has intensified the need for efficient pattern mining techniques that can handle numerical uncertainty while maintaining interpretability. Traditional fuzzy frequent pattern mining algorithms suffer from pattern explosion in dense datasets, generating overwhelming numbers of redundant patterns that hinder practical analysis. This study introduces a novel Maximal Frequent Fuzzy Pattern Mining (MFPM) framework that integrates fuzzy set theory with maximal pattern representation to address these limitations. The proposed methodology employs a multi-phase approach that incorporates aggressive pruning strategies, including maximum cardinality selection and early termination, to reduce the dimensionality of the search space. Evaluation on three datasets (Chess, Connect and Mushroom) demonstrates consistent gains in both effectiveness and efficiency. Time-wise, MFPM accelerates discovery where classical algorithms are slowest: dense regimes and permissive supports. A ternary search algorithm efficiently identifies the longest patterns, while an Anti-Apriori strategy with superset pruning ensures the extraction of only non-redundant maximal patterns. Experimental evaluation on benchmark datasets demonstrates remarkable effectiveness, achieving up to 94.97% pattern reduction compared to traditional FTDA algorithms while maintaining equivalent knowledge representation. Computational efficiency improved by over 65% in challenging low-support scenarios. The framework generates concise, semantically interpretable patterns that capture the most significant relationships in quantitative data, facilitating informed decision-making across diverse application domains, including healthcare analytics, business intelligence, and web usage mining.
- 13 June 2026
- Published by Springer Nature in Scientific Reports
- Vol. 16 (1)
Open AccessEfficient and interpretable maximal frequent fuzzy pattern mining with multi phase pruning and ternary search
The exponential growth of quantitative data across various domains has intensified the need for efficient pattern mining techniques that can handle numerical uncertainty while maintaining interpretability. Traditional fuzzy frequent pattern mining algorithms suffer from pattern explosion in dense datasets, generating overwhelming numbers of redundant patterns that hinder practical analysis. This study introduces a novel Maximal Frequent Fuzzy Pattern Mining (MFPM) framework that integrates fuzzy set theory with maximal pattern representation to address these limitations. The proposed methodology employs a multi-phase approach that incorporates aggressive pruning strategies, including maximum cardinality selection and early termination, to reduce the dimensionality of the search space. Evaluation on three datasets (Chess, Connect and Mushroom) demonstrates consistent gains in both effectiveness and efficiency. Time-wise, MFPM accelerates discovery where classical algorithms are slowest: dense regimes and permissive supports. A ternary search algorithm efficiently identifies the longest patterns, while an Anti-Apriori strategy with superset pruning ensures the extraction of only non-redundant maximal patterns. Experimental evaluation on benchmark datasets demonstrates remarkable effectiveness, achieving up to 94.97% pattern reduction compared to traditional FTDA algorithms while maintaining equivalent knowledge representation. Computational efficiency improved by over 65% in challenging low-support scenarios. The framework generates concise, semantically interpretable patterns that capture the most significant relationships in quantitative data, facilitating informed decision-making across diverse application domains, including healthcare analytics, business intelligence, and web usage mining.
- Open Access
- 8 May 2023
- Published by MDPI AG in Diagnostics
- Vol. 13 (9) , 1654
Automatic Analysis of MRI Images for Early Prediction of Alzheimer’s Disease Stages Based on Hybrid Features of CNN and Handcrafted Features
Alzheimer’s disease (AD) is considered one of the challenges facing health care in the modern century; until now, there has been no effective treatment to cure it, but there are drugs to slow its progression. Therefore, early detection of Alzheimer’s is vital to take needful measures before it develops into brain damage which cannot be treated. Magnetic resonance imaging (MRI) techniques have contributed to the diagnosis and prediction of its progression. MRI images require highly experienced doctors and radiologists, and the analysis of MRI images takes time to analyze each slice. Thus, deep learning techniques play a vital role in analyzing a huge amount of MRI images with high accuracy to detect Alzheimer’s and predict its progression. Because of the similarities in the characteristics of the early stages of Alzheimer’s, this study aimed to extract the features in several methods and integrate the features extracted from more than one method into the same features matrix. This study contributed to the development of three methodologies, each with two systems, with all systems aimed at achieving satisfactory accuracy for the detection of AD and predicting the stages of its progression. The first methodology is by Feed Forward Neural Network (FFNN) with the features of GoogLeNet and DenseNet-121 models separately. The second methodology is by FFNN network with combined features between GoogLeNet and Dense-121 models before and after high-dimensionality reduction of features using the Principal Component Analysis (PCA) algorithm. The third methodology is by FFNN network with combined features between GoogLeNet and Dense-121 models separately and features extracted by Discrete Wavelet Transform (DWT), Local Binary Pattern (LBP) and Gray Level Co-occurrence Matrix (GLCM) methods called handcrafted features. All systems yielded super results in detecting AD and predicting the stages of its progression. With the combined features of the DenseNet-121 and handcrafted, the FFNN achieved an accuracy of 99.7%, sensitivity of 99.64%, AUC of 99.56%, precision of 99.63%, and a specificity of 99.67%.
- 8 May 2023
- Published by MDPI AG in Diagnostics
- Vol. 13 (9) , 1654
Open AccessAutomatic Analysis of MRI Images for Early Prediction of Alzheimer’s Disease Stages Based on Hybrid Features of CNN and Handcrafted Features
Alzheimer’s disease (AD) is considered one of the challenges facing health care in the modern century; until now, there has been no effective treatment to cure it, but there are drugs to slow its progression. Therefore, early detection of Alzheimer’s is vital to take needful measures before it develops into brain damage which cannot be treated. Magnetic resonance imaging (MRI) techniques have contributed to the diagnosis and prediction of its progression. MRI images require highly experienced doctors and radiologists, and the analysis of MRI images takes time to analyze each slice. Thus, deep learning techniques play a vital role in analyzing a huge amount of MRI images with high accuracy to detect Alzheimer’s and predict its progression. Because of the similarities in the characteristics of the early stages of Alzheimer’s, this study aimed to extract the features in several methods and integrate the features extracted from more than one method into the same features matrix. This study contributed to the development of three methodologies, each with two systems, with all systems aimed at achieving satisfactory accuracy for the detection of AD and predicting the stages of its progression. The first methodology is by Feed Forward Neural Network (FFNN) with the features of GoogLeNet and DenseNet-121 models separately. The second methodology is by FFNN network with combined features between GoogLeNet and Dense-121 models before and after high-dimensionality reduction of features using the Principal Component Analysis (PCA) algorithm. The third methodology is by FFNN network with combined features between GoogLeNet and Dense-121 models separately and features extracted by Discrete Wavelet Transform (DWT), Local Binary Pattern (LBP) and Gray Level Co-occurrence Matrix (GLCM) methods called handcrafted features. All systems yielded super results in detecting AD and predicting the stages of its progression. With the combined features of the DenseNet-121 and handcrafted, the FFNN achieved an accuracy of 99.7%, sensitivity of 99.64%, AUC of 99.56%, precision of 99.63%, and a specificity of 99.67%.
- Open Access
- 2 May 2023
- Published by MDPI AG in Diagnostics
- Vol. 13 (9) , 1609
Hybrid Techniques of X-ray Analysis to Predict Knee Osteoarthritis Grades Based on Fusion Features of CNN and Handcrafted
Knee osteoarthritis (KOA) is a chronic disease that impedes movement, especially in the elderly, affecting more than 5% of people worldwide. KOA goes through many stages, from the mild grade that can be treated to the severe grade in which the knee must be replaced. Therefore, early diagnosis of KOA is essential to avoid its development to the advanced stages. X-rays are one of the vital techniques for the early detection of knee infections, which requires highly experienced doctors and radiologists to distinguish Kellgren-Lawrence (KL) grading. Thus, artificial intelligence techniques solve the shortcomings of manual diagnosis. This study developed three methodologies for the X-ray analysis of both the Osteoporosis Initiative (OAI) and Rani Channamma University (RCU) datasets for diagnosing KOA and discrimination between KL grades. In all methodologies, the Principal Component Analysis (PCA) algorithm was applied after the CNN models to delete the unimportant and redundant features and keep the essential features. The first methodology for analyzing x-rays and diagnosing the degree of knee inflammation uses the VGG-19 -FFNN and ResNet-101 -FFNN systems. The second methodology of X-ray analysis and diagnosis of KOA grade by Feed Forward Neural Network (FFNN) is based on the combined features of VGG-19 and ResNet-101 before and after PCA. The third methodology for X-ray analysis and diagnosis of KOA grade by FFNN is based on the fusion features of VGG-19 and handcrafted features, and fusion features of ResNet-101 and handcrafted features. For an OAI dataset with fusion features of VGG-19 and handcrafted features, FFNN obtained an AUC of 99.25%, an accuracy of 99.1%, a sensitivity of 98.81%, a specificity of 100%, and a precision of 98.24%. For the RCU dataset with the fusion features of VGG-19 and the handcrafted features, FFNN obtained an AUC of 99.07%, an accuracy of 98.20%, a sensitivity of 98.16%, a specificity of 99.73%, and a precision of 98.08%.
- 2 May 2023
- Published by MDPI AG in Diagnostics
- Vol. 13 (9) , 1609
Open AccessHybrid Techniques of X-ray Analysis to Predict Knee Osteoarthritis Grades Based on Fusion Features of CNN and Handcrafted
Knee osteoarthritis (KOA) is a chronic disease that impedes movement, especially in the elderly, affecting more than 5% of people worldwide. KOA goes through many stages, from the mild grade that can be treated to the severe grade in which the knee must be replaced. Therefore, early diagnosis of KOA is essential to avoid its development to the advanced stages. X-rays are one of the vital techniques for the early detection of knee infections, which requires highly experienced doctors and radiologists to distinguish Kellgren-Lawrence (KL) grading. Thus, artificial intelligence techniques solve the shortcomings of manual diagnosis. This study developed three methodologies for the X-ray analysis of both the Osteoporosis Initiative (OAI) and Rani Channamma University (RCU) datasets for diagnosing KOA and discrimination between KL grades. In all methodologies, the Principal Component Analysis (PCA) algorithm was applied after the CNN models to delete the unimportant and redundant features and keep the essential features. The first methodology for analyzing x-rays and diagnosing the degree of knee inflammation uses the VGG-19 -FFNN and ResNet-101 -FFNN systems. The second methodology of X-ray analysis and diagnosis of KOA grade by Feed Forward Neural Network (FFNN) is based on the combined features of VGG-19 and ResNet-101 before and after PCA. The third methodology for X-ray analysis and diagnosis of KOA grade by FFNN is based on the fusion features of VGG-19 and handcrafted features, and fusion features of ResNet-101 and handcrafted features. For an OAI dataset with fusion features of VGG-19 and handcrafted features, FFNN obtained an AUC of 99.25%, an accuracy of 99.1%, a sensitivity of 98.81%, a specificity of 100%, and a precision of 98.24%. For the RCU dataset with the fusion features of VGG-19 and the handcrafted features, FFNN obtained an AUC of 99.07%, an accuracy of 98.20%, a sensitivity of 98.16%, a specificity of 99.73%, and a precision of 98.08%.
- Open Access
- 27 January 2023
- Published by Thamar University in Thamar University Journal of Natural & Applied Sciences
- Vol. 1 (1) , 75-92
A Study of α β Tracker with Some New Algorithms for Selecting α and β Parameters
تدرس هذه المقالة مسالة تعقب الهدف و ذلك بواسطة معقب ألفا بيتا، وتناقش بعѧض الخѧواص النظریѧة لهѧذا المعقѧب مع الترآيز على طریقة اختيار المعلمتين ألفا و بيتا. تستعرض أولاً طریقتين تقليدیتين في اختيار هاتين المعلمتين ومن ثم تقترح ثلاثة خوارزميات جدیدة لهذا الغرض. تجرى تجارب بالمحاآاة على مشاهدات مولدة في حالتي التشویش الأبيض و الملون، وتظهر الخوارزميات المقترحة آفاءة جيدة مقارنة بالطریقتين التقليدیتين. This paper deals with target tracking using α β Tracker. Some of the theoretical properties of this classical tracker are discussed and the problem of selecting the suitable α and β parameters is studied. Two well known classical methods of estimating α and β parameters are veiwed and another three new algorithms of estimating these parameters are suggested. Some simulation experiements are performed in the cases of white noise and color noise to check the accuracy of the classical as well as the new ones. The performance of our new suggested algorithms seems to be very well.
- 27 January 2023
- Published by Thamar University in Thamar University Journal of Natural & Applied Sciences
- Vol. 1 (1) , 75-92
Open AccessA Study of α β Tracker with Some New Algorithms for Selecting α and β Parameters
تدرس هذه المقالة مسالة تعقب الهدف و ذلك بواسطة معقب ألفا بيتا، وتناقش بعѧض الخѧواص النظریѧة لهѧذا المعقѧب مع الترآيز على طریقة اختيار المعلمتين ألفا و بيتا. تستعرض أولاً طریقتين تقليدیتين في اختيار هاتين المعلمتين ومن ثم تقترح ثلاثة خوارزميات جدیدة لهذا الغرض. تجرى تجارب بالمحاآاة على مشاهدات مولدة في حالتي التشویش الأبيض و الملون، وتظهر الخوارزميات المقترحة آفاءة جيدة مقارنة بالطریقتين التقليدیتين. This paper deals with target tracking using α β Tracker. Some of the theoretical properties of this classical tracker are discussed and the problem of selecting the suitable α and β parameters is studied. Two well known classical methods of estimating α and β parameters are veiwed and another three new algorithms of estimating these parameters are suggested. Some simulation experiements are performed in the cases of white noise and color noise to check the accuracy of the classical as well as the new ones. The performance of our new suggested algorithms seems to be very well.
- Open Access
- 27 January 2023
- Published by Thamar University in Thamar University Journal of Natural & Applied Sciences
- Vol. 1 (1) , 61-74
Development of Advanced Monitoring System in Real Time Environment
تناقش هѧذه الورقѧة مѧسألة تѧوفير نظѧام جيѧد للمراقبѧة بواسѧطة الحاسѧوب. وآتطبيѧق لѧذلك فقѧد تѧم تѧصميم وبنѧاء نظѧام المراقبة المتقدم (AMS .(یعد النظام المطور نظام زمن حقيقي للمعالجة الصوریة لغرض تعزیز خدمات المراقبة بكلفѧة منخفضة وأداء عالٍ. یأتي هذا التطبيق ضمن مѧساحة بحثيѧة واسѧعة لعلاقتѧه بعѧدة مواضѧيع مهمѧة فѧي علѧم الحاسѧوب وقѧد جرى التحقق من إنجاز الوظائف والخدمات المستهدفة للنظام بشكل موثوق. In this paper, the problem of providing a good computerized monitoring system is discussed. As an application, Advanced Monitoring System (AMS) is designed and built for this purpose. AMS is an image processing, a soft real time system, which is concerned with enhancement of the monitoring services with lower cost and a high performance. It seems to be very broad area of research as it relates to many important subjects of computer science. The produced system has accomplished its intended functions and services in trusted fashion.
- 27 January 2023
- Published by Thamar University in Thamar University Journal of Natural & Applied Sciences
- Vol. 1 (1) , 61-74
Open AccessDevelopment of Advanced Monitoring System in Real Time Environment
تناقش هѧذه الورقѧة مѧسألة تѧوفير نظѧام جيѧد للمراقبѧة بواسѧطة الحاسѧوب. وآتطبيѧق لѧذلك فقѧد تѧم تѧصميم وبنѧاء نظѧام المراقبة المتقدم (AMS .(یعد النظام المطور نظام زمن حقيقي للمعالجة الصوریة لغرض تعزیز خدمات المراقبة بكلفѧة منخفضة وأداء عالٍ. یأتي هذا التطبيق ضمن مѧساحة بحثيѧة واسѧعة لعلاقتѧه بعѧدة مواضѧيع مهمѧة فѧي علѧم الحاسѧوب وقѧد جرى التحقق من إنجاز الوظائف والخدمات المستهدفة للنظام بشكل موثوق. In this paper, the problem of providing a good computerized monitoring system is discussed. As an application, Advanced Monitoring System (AMS) is designed and built for this purpose. AMS is an image processing, a soft real time system, which is concerned with enhancement of the monitoring services with lower cost and a high performance. It seems to be very broad area of research as it relates to many important subjects of computer science. The produced system has accomplished its intended functions and services in trusted fashion.
- 4 December 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
An Effective Algorithm for Mining Interesting Maximal Association Rules
Most existing algorithms focus on Association Rules Mining (ARM) based on a traditional support-confidence framework. These algorithms produce a large number of redundant rules, the majority of which are irrelevant to the users or do not imply a correlation relationship between related itemsets. In this paper, an effective algorithm that incorporates the generation of Maximal Frequent Itemsets (MFIs) that ensures removal of redundancy and correlation analysis has been adopted as an interesting measure is suggested. The proposed algorithm integrates the support-all-confidence measures as a new constraint framework to be pushed deep during the mining process of MFIs to generate a reduced and complete set of All-Confident Correlated Maximal Frequent Itemsets (ACCMFIs) directly from large datasets. Consequently, the generated ACCMFIs are considered as a new basis for the discovery of Interesting Maximal Association Rules (IMARs). The proposed algorithm has been developed, and the experimental results demonstrate its utility and effectiveness.
- 4 December 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
An Effective Algorithm for Mining Interesting Maximal Association Rules
Most existing algorithms focus on Association Rules Mining (ARM) based on a traditional support-confidence framework. These algorithms produce a large number of redundant rules, the majority of which are irrelevant to the users or do not imply a correlation relationship between related itemsets. In this paper, an effective algorithm that incorporates the generation of Maximal Frequent Itemsets (MFIs) that ensures removal of redundancy and correlation analysis has been adopted as an interesting measure is suggested. The proposed algorithm integrates the support-all-confidence measures as a new constraint framework to be pushed deep during the mining process of MFIs to generate a reduced and complete set of All-Confident Correlated Maximal Frequent Itemsets (ACCMFIs) directly from large datasets. Consequently, the generated ACCMFIs are considered as a new basis for the discovery of Interesting Maximal Association Rules (IMARs). The proposed algorithm has been developed, and the experimental results demonstrate its utility and effectiveness.
- Open Access
Path Mapping Approach for Network Function Virtualization Resource Allocation with Network Function Decomposition Support
Recently, Network Function Virtualization (NFV) and Software Defined Networking (SDN) have attracted many mobile operators. For the flexible deployment of Network Functions (NFs) in an NFV environment, NF decompositions and control/user plane separation have been introduced in the literature. That is to map traditional functions into their corresponding Virtual Network Functions (VNFs). This mapping requires the NFV Resource Allocation (NFV-RA) for multi-path service graphs with a high number of virtual nodes and links, which is a complex NP-hard problem that inherited its complexity from the Virtual Network Embedding (VNE). This paper proposes a new path mapping approach to solving the NFV-RA problem for decomposed Network Service Chains (NSCs). The proposed solution has symmetrically considered optimizing an average embedding cost with an enhancement on average execution time. The proposed approach has been compared to two other existing schemes using 6 and 16 scenarios of short and long simulation runs, respectively. The impact of the number of nodes, links and paths of the service requests on the proposed scheme has been studied by solving more than 122,000 service requests. The proposed Integer Linear Programming (ILP) and heuristic schemes have reduced the execution time up to 39.58% and 6.42% compared to existing ILP and heuristic schemes, respectively. Moreover, the proposed schemes have also reduced the average embedding cost and increased the profit for the service providers.
Open AccessPath Mapping Approach for Network Function Virtualization Resource Allocation with Network Function Decomposition Support
Recently, Network Function Virtualization (NFV) and Software Defined Networking (SDN) have attracted many mobile operators. For the flexible deployment of Network Functions (NFs) in an NFV environment, NF decompositions and control/user plane separation have been introduced in the literature. That is to map traditional functions into their corresponding Virtual Network Functions (VNFs). This mapping requires the NFV Resource Allocation (NFV-RA) for multi-path service graphs with a high number of virtual nodes and links, which is a complex NP-hard problem that inherited its complexity from the Virtual Network Embedding (VNE). This paper proposes a new path mapping approach to solving the NFV-RA problem for decomposed Network Service Chains (NSCs). The proposed solution has symmetrically considered optimizing an average embedding cost with an enhancement on average execution time. The proposed approach has been compared to two other existing schemes using 6 and 16 scenarios of short and long simulation runs, respectively. The impact of the number of nodes, links and paths of the service requests on the proposed scheme has been studied by solving more than 122,000 service requests. The proposed Integer Linear Programming (ILP) and heuristic schemes have reduced the execution time up to 39.58% and 6.42% compared to existing ILP and heuristic schemes, respectively. Moreover, the proposed schemes have also reduced the average embedding cost and increased the profit for the service providers.