Amer AlGhadhban

Amer AlGhadhban


Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

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

Representative Publications

View All Publications
3 June 2021 in IEEE Access
Verified
Journal Article
Open access
HAHassan Ali
Hassan Ali
MKMuhammad Suleman Khan
Muhammad Suleman Khan
AAAmer AlGhadhban
Amer AlGhadhban
MAMeshari Alazmi
Meshari Alazmi
AAAhmed Alzamil
Ahmed Alzamil
Junaid QadirJunaid Qadir
Junaid Qadir
With the hyperconnectivity and ubiquity of the Internet, the fake news problem now presents a greater threat than ever before. One promising solution for countering this threat is to leverage deep learning (DL)-based text classification methods for fake-news detection. However, since such methods have been shown to be vulnerable to adversarial attacks, the integrity and security of DL-based fake news classifiers are under question. Although many works study text classification under the adversarial threat, to the best of our knowledge, we do not find any work in literature that specifically analyzes the performance of DL-based fake-news detectors under adversarial settings. We bridge this gap by evaluating the performance of fake-news detectors under various configurations under black-box settings. In particular, we investigate the robustness of four different DL architectural choices—multilayer perceptron (MLP), convolutional neural network (CNN), recurrent neural network (RNN) and a recently proposed Hybrid CNN-RNN trained on three different state-of-the-art datasets—under different adversarial attacks (Text Bugger, Text Fooler, PWWS, and Deep Word Bug) implemented using the state-of-the-art NLP attack library, Text-Attack. Additionally, we explore how changing the detector complexity, the input sequence length, and the training loss affect the robustness of the learned model. Our experiments suggest that RNNs are robust as compared to other architectures. Further, we show that increasing the input sequence length generally increases the detector’s robustness. Our evaluations provide key insights to robustify fake-news detectors against adversarial attacks.

1 August 2022 in Mathematics
Verified
Journal Article
Open access
PDF file
SASadiq H. Abdulhussain
Sadiq H. Abdulhussain
BMBasheera M. Mahmmod
Basheera M. Mahmmod
AAAmer AlGhadhban
Amer AlGhadhban
JFJan Flusser
Jan Flusser
Face recognition is required in various applications, and major progress has been witnessed in this area. Many face recognition algorithms have been proposed thus far; however, achieving high recognition accuracy and low execution time remains a challenge. In this work, a new scheme for face recognition is presented using hybrid orthogonal polynomials to extract features. The embedded image kernel technique is used to decrease the complexity of feature extraction, then a support vector machine is adopted to classify these features. Moreover, a fast-overlapping block processing algorithm for feature extraction is used to reduce the computation time. Extensive evaluation of the proposed method was carried out on two different face image datasets, ORL and FEI. Different state-of-the-art face recognition methods were compared with the proposed method in order to evaluate its accuracy. We demonstrate that the proposed method achieves the highest recognition rate in different considered scenarios. Based on the obtained results, it can be seen that the proposed method is robust against noise and significantly outperforms previous approaches in terms of speed.

1 July 2018
Verified
Conference Paper
Closed access
AAAmer AlGhadhban
Amer AlGhadhban
BSBasem Shihada
Basem Shihada
In this work, we propose FLight, a fast, lightweight and adaptive mechanism for detecting elephant-flows while improving the detection accuracy and speed. FLight leverages the TCP communication behavior for its detection algorithm, it demonstrates a 100% elephant-flow detection accuracy, and is 242× faster than other centralized solutions.

9 June 2025 in Computers in Biology and Medicine
Verified
Journal Article
Closed access
AAAmer AlGhadhban
Amer AlGhadhban
Rabie A. RamadanRabie A. Ramadan
Rabie A. Ramadan
MAMeshari Alazmi
Meshari Alazmi

1 April 2018
Verified
Conference Paper
Closed access
AAAmer AlGhadhban
Amer AlGhadhban
BSBasem Shihada
Basem Shihada
Software Defined Networking (SDN) provides network engineers with a high-level of abstraction to manage network traffic and control the associated network resources. Unfortunately, the data-plane devices communicate with the controller for every new flow, which adds an extra overhead and causes excessive delays. Such communication relies on the probability called matching probability. In this work, we propose a mathematical model for the SDN flow-setup process with the consideration of all factors that contribute into the matching probability, such as proactive/reactive flow setup modes. Finally, we attempt at deriving the overall system capacity and blocking probability.

9 January 2019 in IEEE Access
Verified
Journal Article
Open access
AAAbdullah Al-Halafi
Abdullah Al-Halafi
AAAmer AlGhadhban
Amer AlGhadhban
BSBasem Shihada
Basem Shihada