MFMona Farouk

Mona Farouk

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

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


Mona Farouk has a total of 26 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    EPOBPA: Extensible Parallelizable Optimized Buddy Prima Algorithm

    by Mona Farouk, Mohamed Abdel Gawwad

    Data is the growing new natural resource; in today’s world many organizations have a vast amount of data and they need a method to get benefits of it. Every day different systems generate more than 2.5 Quintilian bytes of data; and there is a fact that 90% of the data have been created in the last 10 years. Frequent Itemset Mining (FIM) finds valuable associations and establishes a correlation relationship between large sets of data items. Association rules describe attribute value conditions that occur frequently together in a given dataset. Existing FIM algorithms depend mainly on candidate sets generation like Apriori algorithm or on constructing data structure to handle datasets like FP-Growth. In the big data era these techniques come with high time overhead. E-POBPA presents a new FIM technique to handle big data with neither candidate generation step nor creating a specific data structure. The proposed algorithm is built upon the original Buddy Prima algorithm. It encompasses a distribution method that makes it customizable for any hardware architecture used. The Experimental results show that E-POBPA surpasses state of the art techniques in its time performance. The time improvement over other approaches ranges between 36% and 99% depending on the dataset and the minimum support used.

  • Customer Churn Prediction Based on Sentiment Score

    by Shadha H. Al-Safi, Ahmed Rafea, Mona Farouk

  • Open Access

    Rethinking of BERT sentence embedding for text classification

    by Omar Galal, Ahmed H. Abdel-Gawad, Mona Farouk

    Text classification is a fundamental task in NLP that is used in several real-life tasks and applications. Large pre-trained language models such as BERT achieve state-of-the-art performance in several NLP tasks including text classification tasks. Although BERT boosts text classification performance, the common way of using it for classification lacks many aspects of its advantages. This work rethinks the way of using BERT final layer and hidden layers embeddings by proposing different aggregation architectures for text classification tasks such as sentiment analysis and sarcasm detection. This research also proposes different approaches for using BERT as a feature extractor without fine-tuning whose performance surpasses its fine-tuning counterpart. It also proposes promising multi-task learning aggregation architectures to improve the performance of the related classification problems. The experiments of the different architectures show that freezing BERT can outperform fine-tuning it for sentiment analysis. The experiments also show that multi-task learning while freezing BERT boosts the performance of yet hard tasks such as sarcasm detection. The best-performing models achieved new state-of-the-art performance on the ArSarcasm-v2 dataset for Arabic sarcasm detection and sentiment analysis. For multi-task learning and freezing BERT, a new SOTA F1-score of 64.41 was achieved for the sarcasm detection with a 3.47% improvement and near SOTA FPN of 75.78 for the sentiment classification. For single-task learning, a new SOTA FPN of 75.26 was achieved for the sentiment with a 1.81% improvement.


  • Open Access

    ASCF: Optimization of the Apriori Algorithm Using Spark-Based Cuckoo Filter Structure

    by Bana Ahmad Alrahwan, Mona Farouk

    Data mining is the process used for extracting hidden patterns from large databases using a variety of techniques. For example, in supermarkets, we can discover the items that are often purchased together and that are hidden within the data. This helps make better decisions which improve the business outcomes. One of the techniques that are used to discover frequent patterns in large databases is frequent itemset mining (FIM) that is a part of association rule mining (ARM). There are different algorithms for mining frequent itemsets. One of the most common algorithms for this purpose is the Apriori algorithm that deduces association rules between different objects which describe how these objects are related together. It can be used in different application areas like market basket analysis, students courses selection process in the E-learning platforms, stock management, and medical applications. Nowadays, there is a great explosion of data that will increase the computational time in the Apriori algorithm. Therefore, there is a necessity to run the data-intensive algorithms in a parallel-distributed environment to achieve a convenient performance. In this paper, optimization of the Apriori algorithm using the Spark-based cuckoo filter structure (ASCF) is introduced. ASCF succeeds in removing the candidate generation step from the Apriori algorithm to reduce computational complexity and avoid costly comparisons. It uses the cuckoo filter structure to prune the transactions by reducing the number of items in each transaction. The proposed algorithm is implemented on the Spark in-memory processing distributed environment to reduce processing time. ASCF offers a great improvement in performance over the other candidate algorithms based on Apriori, where it achieves a time of only 5.8 of the state-of-the-art approach on the retail dataset with a minimum support of 0.75.


  • Open Access

    Neuromodulatory effect of vardenafil on aluminium chloride/d-galactose induced Alzheimer’s disease in rats: emphasis on amyloid-beta, p-tau, PI3K/Akt/p53 pathway, endoplasmic reticulum stress, and cellular senescence

    by Heba H. Awad, Mahmoud A. Desouky, Alaa Zidan, Mariam Bassem, Amaal Qasem, Mona Farouk, Haidy AlDeab, Miral Fouad, Cherry Hany, Nada Basem, et al.

    Dysregulation of protein homeostasis, proteostasis, is a distinctive hallmark of many neurodegenerative disorders and aging. Deleteriously, the accumulation of aberrant proteins in Alzheimer’s disease (AD) is accompanied with a marked collapse in proteostasis network. The current study explored the potential therapeutic effect of vardenafil (VAR), a phosphodiesterase-5 inhibitor, in AlCl3/d-galactose (d-gal)-induced AD in rats and its possible underlying mechanisms. The impact of VAR treatment on neurobehavioral function, hippocampal tissue architecture, and the activity of the cholinergic system main enzymes were assessed utilizing VAR at doses of 0.3 mg/kg and 1 mg/kg. Additionally, the expression level of amyloid-beta and phosphorylated tau proteins in the hippocampus were figured out. Accordingly, VAR higher dose was selected to contemplate the possible underlying mechanisms. Intriguingly, VAR elevated the cyclic guanosine monophosphate level in the hippocampus and averted the repressed proteasome activity by AlCl3/d-gal; hence, VAR might alleviate the burden of toxic protein aggregates in AD. In addition, a substantial reduction in the activating transcription factor 6-mediated endoplasmic reticulum stress was demonstrated with VAR treatment. Notably, VAR counteracted the AlCl3/d-gal-induced depletion of nuclear factor erythroid 2-related factor 2 level. Moreover, the anti-senescence activity of VAR was demonstrated via its ability to restore the balance of the redox circuit. The modulation of phosphatidylinositol-3-kinase/protein kinase B/p53 pathway and the reduction of nuclear factor kappa B level, the key regulator of senescence-associated secretory phenotype mediators release, with VAR treatment were also elucidated. Altogether, these findings insinuate the possible therapeutic benefits of VAR in AD management. Graphic


  • Open Access

    Active learning for Arabic sentiment analysis

    by Abdelrahman Kaseb, Mona Farouk


  • Open Access

    SAIDS: A Novel Approach for Sentiment Analysis Informed of Dialect and Sarcasm

    by Abdelrahman Kaseb, Mona Farouk

    Sentiment analysis becomes an essential part of every social network, as it enables decision-makers to know more about users' opinions in almost all life aspects. Despite its importance, there are multiple issues it encounters like the sentiment of the sarcastic text which is one of the main challenges of sentiment analysis. This paper tackles this challenge by introducing a novel system (SAIDS) that predicts the sentiment, sarcasm and dialect of Arabic tweets. SAIDS uses its prediction of sarcasm and dialect as known information to predict the sentiment. It uses MARBERT as a language model to generate sentence embedding, then passes it to the sarcasm and dialect models, and then the outputs of the three models are concatenated and passed to the sentiment analysis model. Multiple system design setups were experimented with and reported. SAIDS was applied to the ArSarcasm-v2 dataset where it outperforms the state-of-the-art model for the sentiment analysis task. By training all tasks together, SAIDS achieves results of 75.98 FPN, 59.09 F1-score and 71.13 F1-score for sentiment analysis, sarcasm detection, and dialect identification respectively. The system design can be used to enhance the performance of any task which is dependent on other tasks.


  • Open Access

    Frequent Itemset Mining for Big Data Using Greatest Common Divisor Technique

    by Mohamed A. Gawwad, Mona F. Ahmed, Magda B. Fayek

    The discovery of frequent itemsets is one of the very important topics in data mining. Frequent itemset discovery techniques help in generating qualitative knowledge which gives business insight and helps the decision makers. In the Big Data era the need for a customizable algorithm to work with big data sets in a reasonable time becomes a necessity. In this paper we propose a new algorithm for frequent itemset discovery that could work in distributed manner with big datasets. Our approach is based on the original Buddy Prima algorithm and the Greatest Common Divisor (GCD) calculation between itemsets which exist in the transaction database. The proposed algorithm introduces a new method to parallelize the frequent itemset mining without the need to generate candidate itemsets and also it avoids any communication overhead between the participated nodes. It explores the parallelism abilities in the hardware in case of single node operation. The proposed approach could be implemented using map-reduce technique or Spark. It was successfully applied on different size transactions DBs and compared with two well-known algorithms: FP-Growth and Parallel Apriori with different support levels. The experiments showed that the proposed algorithm achieves major time improvement over both algorithms especially with datasets having huge number of items


  • Open Access

    PROTECTIVE ROLE OF VITAMIN C AND GREEN TEA EXTRACT ON MALATHION-INDUCED HEPATOTOXICITY AND NEPHROTOXICITY IN RATS

    by Rabab R. Elzoghby, Ahlam F. Hamoda, A. Abed-Ftah, Mona Farouk

    PROTECTIVE ROLE OF VITAMIN C AND GREEN TEA EXTRACT ON MALATHION-INDUCED HEPATOTOXICITY AND NEPHROTOXICITY IN RATS