MYMourad Ykhlef

Mourad Ykhlef

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Mourad Ykhlef has a total of 4 co-authors. Here are the top co-authors by number of shared publications:

  • Abeer Al-Nafjan

    Computer Science Department, College of Computer and Information Sciences, Imam Mohammad Ibn Saud Islamic University (IMSIU), Riyadh 11432, Saudi Arabia

    1 shared publication
  • Maram Alamri

    Information System Department, College of Computer and Information Sciences, King Saud University, Riyadh 11543, Saudi Arabia

    1 shared publication
  • Mashael Aldayel

    Information Technology Department, College of Computer and Information Sciences, King Saud University, Riyadh 11543, Saudi Arabia

    1 shared publication
  • Mashael Aldrees

    Department of Information Systems, Collage of Computer and Information Sciences, King Saud University

    1 shared publication

Latest Publications

  • Top Cited Papers
    Open Access

    Hybrid Undersampling and Oversampling for Handling Imbalanced Credit Card Data

    by Maram Alamri, Mourad Ykhlef

    Recent developments in the use of credit cards for a range of daily life activities have increased credit card fraud and caused huge financial losses for individuals and financial institutions. Most credit card frauds are conducted online through illegal payment authorizations by data breaches, phishing, or scams. Many solutions have been suggested for this issue, but they all face the major challenge of building an effective detection model using highly imbalanced class data. Most sampling techniques used for class imbalance have limitations, such as overlapping and overfitting, which cause inaccurate learning and are slowed down by noisy features. Herein, a hybrid Tomek links BIRCH Clustering Borderline SMOTE (BCBSMOTE) sampling method is proposed to balance a highly skewed credit card transaction dataset. First, Tomek links were used to undersample majority instances and remove noise, and then BIRCH clustering was applied to cluster the data and oversample minority instances using B-SMOTE. The credit card fraud-detection model was run using a random forest (RF) classifier. The proposed method achieved a higher F1-score (85.20%) than the baseline sampling techniques tested for comparison. Because of the enormous number of credit card transactions, there was still a small false-positive rate. The proposed method improves the detection performance owing to the well-organized balancing of the dataset.


  • Open Access

    Electroencephalogram-Based Preference Prediction Using Deep Transfer Learning

    by Mashael S. Aldayel, Mourad Ykhlef, Abeer N. Al-Nafjan

    Transfer learning is an approach in machine learning where a model that was built and trained on one task is re-purposed on a second task. The success of transfer learning in computer vision has motivated its use in neuroscience. Although common in image recognition, the use of transfer learning in EEG classification remains unexplored. Most EEG-based neuroscience studies depend on using traditional machine learning algorithms to answer a question, rather than on improving the algorithms. Developing algorithms for transfer learning for EEG can also assist with problems of low data availability in EEG classification. The primary objective of this study is to investigate EEG-based transfer learning and propose deep transfer learning models to transfer knowledge from emotion recognition to preference recognition to enhance the classification prediction accuracy. To the best of our knowledge, this is the first study demonstrating the effect of applying deep transfer learning between EEG-based emotion recognition and EEG-based preference detection. We propose different approaches for deep transfer learning models to detect preferences from EEG signals using the preprocessed DEAP dataset. Two types of features were extracted from EEG signals, namely the power spectral density and valence. We built three models of deep neural networks: basic without transfer learning, fine-tuning of deep transfer learning, and retraining of deep transfer learning. We compared the performance of deep transfer learning with those of deep neural networks and other conventional classification algorithms such as support vector machine, random forest, and k-nearest neighbor. Although the deep neural network classifiers achieved a high accuracy of greater than 87%, deep transfer learning achieved the highest accuracy result of 93%. The results demonstrate that although the proposed deep transfer learning approaches exhibit higher accuracy than the support vector machine and k-nearest neighbor classifiers, random forest achieves results similar to those of deep transfer learning.