Anas Youssef

Dr. Anas Youssef

orcid

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
7 January 2025 in Applied Sciences
Verified
Journal Article
Open access
PDF file
JKJumana Yousef Khaseeb
Jumana Yousef Khaseeb
AKArabi Keshk
Arabi Keshk
AYAnas Youssef
Anas Youssef
Feature selection is a preprocessing step for various classification tasks. Its objective is to identify the most optimal features in a dataset by eliminating redundant data while preserving the highest possible classification accuracy. Three improved binary Grey Wolf Optimization (GWO) approaches are proposed in this paper to optimize the feature selection process by enhancing the feature selection accuracy while selecting the least possible number of features. Each approach combines GWO with Particle Swarm Optimization (PSO) by implementing GWO followed by PSO. Afterwards, each approach manipulates the solutions obtained by both algorithms in a different way. The objective of this combination is to overcome the GWO stuck-in-local-optima problem that might occur by leveraging the PSO-wide search space exploration ability on the solutions obtained by GWO. Both S-shaped and V-shaped binary transfer functions were used to convert the continuous solutions obtained from each proposed approach to their corresponding binary versions. The three proposed approaches were evaluated using nine small-instance, high-dimensional, cancer-related human gene expression datasets. A set of comparisons were made against the original binary versions of both GWO and PSO algorithms and against eight state-of-the-art feature selection binary optimizers in addition to one of the recent binary optimizers that combines PSO with GWO. The evaluation results showed that one of the proposed S-shaped and V-shaped approaches achieved 0.9 and 0.95 average classification accuracy, respectively, while selecting the fewest number of features. The results also confirmed the superiority of one of the proposed V-shaped approaches when compared with the original binary GWO and PSO approaches. Moreover, the results confirmed the superiority, in most of the datasets, of one of the three approaches over the state-of-the-art approaches. Finally, the results revealed that the best approach in terms of classification accuracy, fitness value, and number of selected features had the highest computational complexity.

24 May 2021 in IJCI. International Journal of Computers and Information
Verified
Journal Article
Closed access
JKJumana Yousef Khaseeb
Jumana Yousef Khaseeb
AYAnas Youssef
Anas Youssef
AKArabi Keshk
Arabi Keshk
High dimensional datasets expose a critical obstacle in machine learning. Feature selection overcomes this obstacle by eliminating duplicated and unimportant features from the dataset to increase the robustness of learning algorithms. This paper introduces a binary version of a hybrid swarm intelligence approach as a wrapper method for feature selection that gathers between the strengths of both the grey wolf and particle swarm optimizers. This approach is named Improved Binary Grey Wolf Optimization (IBGWO). The original version of this hybrid approach was proposed in the literature with a continuous search space as a high-level hybrid form, which runs the optimizers one after the other. Two different types of transfer functions, named S-Shaped and V-Shaped, are applied in this work to turn continuous data into binary. Nine of high-dimensional small-instance medical datasets are employed to assess the proposed approach. The experimental results demonstrate that IBGWO based on S-Shaped (IBGWO-S) outperforms the binary particle swarm and the binary grey wolf optimizers on six out of nine datasets according to the classification accuracy and fitness values. IBGWO-S selects the fewest features on 100% of the datasets. The results show IBGWO based on V-Shaped (IBGWO-V) outperforms the binary particle swarm and binary grey wolf optimizers on five datasets based on the classification accuracy and fitness values. The results indicate that IBGWO-V outperforms IBGWO-S in terms of all studied evaluation metrics. The results also show that IBGWO-S and IBGWO-V outperform eight meta-heuristics known in the literature in selecting the relevant features with acceptable classification accuracy.

15 August 2017 in Journal of Cloud Computing
Verified
Journal Article
Open access
PDF file
AYAnas Youssef
Anas Youssef
DKDiwakar Krishnamurthy
Diwakar Krishnamurthy
Enterprise applications are being increasingly deployed on cloud infrastructures. Often, a cloud service provider (SP) enters into a Service Level Agreement (SLA) with a cloud subscriber, which specifies performance requirements for the subscriber’s applications. An SP needs systematic Service Level Planning (SLP) tools that can help estimate the resources needed and hence the cost incurred to satisfy their customers’ SLAs. Enterprise applications typically experience bursty workloads and the impact of such bursts needs to be considered during SLP exercises. Unfortunately, most existing approaches do not consider workload burstiness. We propose a Resource Allocation Planning (RAP) technique, which allows an SP to identify a time varying allocation plan of resources to applications that satisfies bursts. Extensive simulation results show that the proposed RAP variants can identify resource allocation plans that satisfy SLAs without exhaustively generating all possible plans. Furthermore, the results show that RAP can permit SPs to more accurately determine the capacity required for meeting specified SLAs compared to other competing techniques especially for bursty workloads.

24 May 2021 in IJCI. International Journal of Computers and Information
Verified
Journal Article
Open access
AEAmany El-Deeb
Amany El-Deeb
AEAshraf Elsisi
Ashraf Elsisi
AYAnas Youssef
Anas Youssef
—To transmit data securely between different parties, a variety of security approaches have been proposed in the literature. Specifically, DNA based cryptography and steganography approaches were used to secure data transmission. In this paper, a substitution-based method for data hiding in DNA sequences is proposed. In the proposed data hiding method, data is encoded using a binary coding rule then the data is hidden into a DNA sequence. The proposed method provides an enhancement on a previously proposed DNA substitution method named Least Significant Base method. The proposed enhancement is based on a simple idea that, to the best of our knowledge, was not applied before. It was noticed that the DNA Amino acids can be organized into groups where each DNA codon in one of the groups can be used to encode two bits of the hidden message rather than only one bit as proposed by the Least Significant Base method. Like the Least Significant Base method, the proposed method is blind, preserves the DNA original biological structure in the fake DNA sequence and provides no expansion in the DNA sequence. The proposed method is evaluated using a public DNA sequences dataset named BALIBASE. The evaluation results showed that the proposed method achieved about 50% increase in the data hiding capacity when compared with the Least Significant Base method. Moreover, the results showed that the proposed method resulted in significant decrease in the cracking probability of the Least Significant Base method.

1 February 2023 in International Journal of Electrical and Computer Engineering (IJECE)
Verified
Journal Article
Open access
PDF file
JKJumana Yousef Khaseeb
Jumana Yousef Khaseeb
AKArabi Keshk
Arabi Keshk
AYAnas Youssef
Anas Youssef
Feature selection aims to reduce the dimensionality of a dataset by removing superfluous attributes. This paper proposes a hybrid approach for feature selection problem by combining particle swarm optimization (PSO), grey wolf optimization (GWO), and tournament selection (TS) mechanism. Particle swarm enhances the diversification at the beginning of the search mechanism, grey wolf enhances the intensification at the end of the search mechanism, while tournament selection maintains diversification not only at the beginning but also at the end of the search process to achieve local optima avoidance. A time-varying transition parameter and a random variable are used to select either particle swarm, grey wolf, or tournament selection techniques during search process. This paper proposes different variants of this approach based on S-shaped and V-shaped transfer functions (TFs) to convert continuous solutions to binaries. These variants are named hybrid tournament grey wolf particle swarm (HTGWPS), followed by S or V letter to indicate the TF type, and followed by the TF’s number. These variants were evaluated using nine high-dimensional datasets. The results revealed that HTGWPS-V1 outperformed other V’s variants, PSO, and GWO on 78% of the datasets based on maximum classification accuracy obtained by a minimal feature subset. Also, HTGWPS-V1 outperformed six well-known-metaheuristics on 67% of the datasets.

8 June 2024 in IJCI. International Journal of Computers and Information
Verified
Journal Article
Closed access
ASAlaa Mokhtar Sakr
Alaa Mokhtar Sakr
AKArabi Keshk
Arabi Keshk
AYAnas Youssef
Anas Youssef
There are huge Arabic comparative sentences that are generated daily on various social media. These comparative sentences need to be analyzed and mined for different purposes such as service and product reviews. In general, analysis and mining of Arabic text is a big challenge due to the limitations inherited in the Arabic language. Moreover, there are currently no standard datasets for Arabic comparative sentences. This paper provides a background on the different steps required to analyze and mine an Arabic comparative sentence. These steps include the identification of the Arabic comparative sentence, the identification of the sentence type, and finally the extraction of a relation together with a preferred entity. The paper also provides a literature review of current research work applied in this research field. This includes a classification of the various techniques leveraged in this field including three main categories namely: linguistic, machine learning and deep learning approaches. Finally, the paper provides insights on current limitations and future research challenges in this field. To the best of our knowledge, this is the first research paper that provides a dedicated literature review about the analysis and mining of Arabic comparative sentences. This review discusses the specific analysis of Arabic comparative sentences not the general Arabic sentiment analysis. It is noted that this analysis is a subset of the Arabic sentiment analysis field which does not focus on identifying the sentiment of an Arabic sentence, however, it focuses on identifying and analyzing an Arabic comparative sentence and its components.