IEIbrahim El-Henawy

Ibrahim El-Henawy

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Ibrahim El-Henawy has a total of 5 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    FL-ToLeD: An Improved Lightweight Attention Convolutional Neural Network Model for Tomato Leaf Diseases Classification for Low-End Devices

    by Mahmoud H. Alnamoly, Anar A. Hady, Sherine M. Abd El-Kader, Ibrahim El-Henawy

    The agricultural sector is still a major provider of many countries’ economies, but diseases that continuously infect plants represent continuous threats to agriculture and cause massive losses to the country’s economy. In this study, a lightweight convolutional neural network model called FL-ToLeD was proposed for tomato disease classification based on a soft attention mechanism with a depth-wise separable convolution layer. With a model size of 2.5 MB and 221,594 trainable parameters, FL-ToLeD achieved 99.5%, 99.10%, 99.04% for training, validation and testing accuracy respectively, and 99 % for each of precision, recall, and f1-score, it also achieved 99.90% for ROC-AUC with average inference time of 2.06924 μs. FL-ToLeD outperformed H. Ulutaş (2023) by 2.2% in terms of accuracy, precision, recall and f1-score. Additionally, it performed better than M. Agarwal (2023), Abbas (2021), and S. Verma (2020) in terms of accuracy, precision, recall, and f1-score by 8%, 2%, and 6%, respectively. It also outperformed Arshad (2023) by 4.77%, 8.92%, 35.18% and 5.11% in terms of accuracy, precision, recall and f1-score, respectively. Furthermore, FL-ToLeD is 90 times smaller than S. Verma (2020) and 2.5 times smaller than H. Ulutaş (2023) in terms of model size. All this makes FL-ToLeD more suitable for low-end devices in precision agriculture.


  • Open Access

    Scalable Clustering Algorithms for Big Data: A Review

    by Mahmoud A. Mahdi, Khalid M. Hosny, Ibrahim Elhenawy

    Clustering algorithms have become one of the most critical research areas in multiple domains, especially data mining. However, with the massive growth of big data applications in the cloud world, these applications face many challenges and difficulties. Since Big Data refers to an enormous amount of data, most traditional clustering algorithms come with high computational costs. Hence, the research question is how to handle this volume of data and get accurate results at a critical time. Despite ongoing research work to develop different algorithms to facilitate complex clustering processes, there are still many difficulties that arise while dealing with a large volume of data. In this paper, we review the most relevant clustering algorithms in a categorized manner, provide a comparison of clustering methods for large-scale data and explain the overall challenges based on clustering type. The key idea of the paper is to highlight the main advantages and disadvantages of clustering algorithms for dealing with big data in a scalable approach behind the different other features.