Article Per Year (5 Year)
p-Index From 2021 - 2026
1.066
P-Index
This Author published in this journals
All Journal International Journal of Electrical and Computer Engineering IAES International Journal of Artificial Intelligence (IJ-AI)
Nouh, Said
Unknown Affiliation
Computer Science & IT Electrical & Electronics Engineering Engineering

Published : 6 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 6 Documents
Search

 1 
Enhancing feature selection with a novel hybrid approach incorporating genetic algorithms and swarm intelligence techniques Benghazouani, Salsabila; Nouh, Said; Zakrani, Abdelali; Haloum, Ihsane; Jebbar, Mostafa
International Journal of Electrical and Computer Engineering (IJECE) Vol 14, No 1: February 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v14i1.pp944-959

Abstract

Computing advances in data storage are leading to rapid growth in large-scale datasets. Using all features increases temporal/spatial complexity and negatively influences performance. Feature selection is a fundamental stage in data preprocessing, removing redundant and irrelevant features to minimize the number of features and enhance the performance of classification accuracy. Numerous optimization algorithms were employed to handle feature selection (FS) problems, and they outperform conventional FS techniques. However, there is no metaheuristic FS method that outperforms other optimization algorithms in many datasets. This motivated our study to incorporate the advantages of various optimization techniques to obtain a powerful technique that outperforms other methods in many datasets from different domains. In this article, a novel combined method GASI is developed using swarm intelligence (SI) based feature selection techniques and genetic algorithms (GA) that uses a multi-objective fitness function to seek the optimal subset of features. To assess the performance of the proposed approach, seven datasets have been collected from the UCI repository and exploited to test the newly established feature selection technique. The experimental results demonstrate that the suggested method GASI outperforms many powerful SI-based feature selection techniques studied. GASI obtains a better average fitness value and improves classification performance.
A new efficient decoder of linear block codes based on ensemble learning methods El Assad, Mohammed; Nouh, Said; Chemseddine Idrissi, Imrane; El Kasmi Alaoui, Seddiq; Aylaj, Bouchaib; Azzouazi, Mohamed
IAES International Journal of Artificial Intelligence (IJ-AI) Vol 13, No 2: June 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijai.v13.i2.pp2236-2246

Abstract

Error-correcting codes are used to partially or completely correct errors as much as possible, while ensuring high transmission speeds. Several machine learning models such as logistic regression and decision tree have been applied to correct transmission errors. Among the most powerful machine learning techniques are aggregation methods which have yielded to excellent results in many areas of research. It is this excellence that has prompted us to consider their application for the hard decoding problem. In this sense, we have successfully designed, tested and validated our proposed EL-BoostDec decoder (hard decision decoder based on ensemble learning-boosting technique) which is based on computing of the syndrome of the received word and on using ensemble learning techniques to find the corresponding corrigible error. The obtained results with EL-BoostDec are very encouraging in terms of the binary error rate (BER) that it offers. Practically EL-BoostDec has succeed to correct 100% of errors that have weights less than or equal to the correction capability of studied codes. The comparison of EL-BoostDec with many competitors proves its power. A study of parameters which impact on EL-BoostDec performances has been established to obtain a good BER with minimum run time complexity.
Predicting academic performance: toward a model based on machine learning and learner’s intelligences Rafiq, Jamal Eddine; Abdelali, Zakrani; Amraouy, Mohammed; Nouh, Said; Bennane, Abdellah
International Journal of Electrical and Computer Engineering (IJECE) Vol 15, No 1: February 2025
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v15i1.pp645-653

Abstract

With the rapid evolution of online learning environments, the ability to predict students' academic performance has become crucial for personalizing and enhancing the educational experience. In this article, we present a predictive model based on machine learning techniques, designed to be integrated into online learning platforms using the competency-based approach. This model leverages features from four key dimensions: demographic, social, emotional, and cognitive, to accurately predict learners' academic performance. We detail the methodology for collecting and processing learning traces, distinguishing between explicit traces, such as demographic data, and implicit traces, which capture learners' interactions and behaviors during their learning process. The analysis of these data not only improves the accuracy of performance predictions but also provides valuable insights into skill acquisition and learners' personal development. The results of this study demonstrate the potential of this model to transform online education by making it more adaptive and focused on individual learners' needs.
Enhancing breast cancer diagnosis: a comparative analysis of feature selection techniques Benghazouani, Salsabila; Nouh, Said; Zakrani, Abdelali
IAES International Journal of Artificial Intelligence (IJ-AI) Vol 13, No 4: December 2024
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijai.v13.i4.pp4312-4322

Abstract

Breast cancer is a significant contributor to female mortality, emphasizing the importance of early detection. Predicting breast cancer accurately remains a complex challenge within medical data analysis. Machine learning (ML) algorithms offer valuable assistance in decision-making and diagnosis using medical data. Numerous research studies highlight the effectiveness of ML techniques in improving breast cancer prediction. Feature selection plays a pivotal role in data preprocessing, eliminating irrelevant and redundant features to minimize feature count and improve classification accuracy. This study focuses on optimizing breast cancer diagnostics through feature selection methods, specifically genetic algorithms (GA) and particle swarm optimization (PSO). The research involves a comparative analysis of these methods and the application of a diverse set of ML classification techniques, including logistic regression (LR), support vector machine (SVM), decision tree (DT), and ensemble methods like random forest (RF), AdaBoost, and gradient boosting (GB), using a breast cancer dataset. The models' performance is subsequently evaluated using various performance metrics. The experimental findings illustrate that PSO achieved the highest average accuracy, reaching 99.6% when applied to AdaBoost, while GA attained an accuracy rate of 99.5% when employed with both AdaBoost and RF.
New family of error-correcting codes based on genetic algorithms Bellfkih, El Mehdi; Nouh, Said; Chemseddine Idrissi, Imrane; Louartiti, Khalid; Mouline, Jamal
IAES International Journal of Artificial Intelligence (IJ-AI) Vol 14, No 2: April 2025
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijai.v14.i2.pp1077-1086

Abstract

This paper introduces a novel error-correcting code (ECC) construction and decoding approach utilizing genetic algorithms (GAs). Classical ECCs often struggle with efficiency in correcting multiple errors due to time-consuming matrix-based encoding and decoding processes. Our GA-based method optimizes generator vectors to maximize the minimum distance between codewords, enhancing error correction capabilities. Specifically, we construct a new family of ECCs with code length 31, dimension 12, and minimum distance 7, reducing complexity from O(kn) to O(k(n−k)) by encoding message blocks with vectors instead of matrices. In the decoding phase, the GA effectively corrects errors in received codewords. Experimental results show that at a signal-to-noise ratio (SNR) of 7.7 dB, our method achieves a bit error rate (BER) of 10−5 after only 9 generations of the GA. These results demonstrate improved error correction and decoding performance compared to traditional methods. This study contributes an innovative approach using GAs for error correction, offering simpler encoding and robust performance in coding schemes.
Optimal design, decoding, and minimum distance analysis of Goppa codes using heuristic method Aylaj, Bouchaib; Nouh, Said; Belkasmi, Mostafa
International Journal of Electrical and Computer Engineering (IJECE) Vol 15, No 6: December 2025
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v15i6.pp5411-5421

Abstract

Error-correcting codes are crucial to ensure data reliability in communication systems often affected by transmission noise. Building on previous successful applications of our heuristic method degenerate quantum simulated annealing (DQSA) to Bose–Chaudhuri–Hocquenghem (BCH) and quadratic residue (QR) codes. This paper proposes two algorithms designed to address two coding problems for Goppa codes. DQSA-dmin computes the minimum distance (dmin) while DQSA-Dec, serves as a hard decoder optimized for additive white gaussian noise (AWGN) channels. We validate DQSA-dmin comparing its computed minimum distances with theoretical estimates for algebraically constructed Goppa codes, showing accuracy and efficiency. DQSA-dmin further used to find the optimal Goppa codes that reach the lower bound of dmin for linear codes known in the literature and stored in Marcus Grassl's online database. Indeed, we discovered 12 Goppa codes reaching this lower bound. For DQSA-Dec, experimental results show that it obtains a bit error rate (BER) of 10-5 when SNR=7.5 for codes with lengths less than 65, which is very interesting for a hard decoder. Additionally, a comparison with the Paterson algebraic decoder specific to this code family shows that DQSA-Dec outperforms it with a 0.6 dB coding gain at BER=10-4. These findings highlight the effectiveness of DQSA-based algorithms in designing and decoding Goppa codes.
Co-Authors Abdelali, Zakrani Amraouy, Mohammed Aylaj, Bouchaib Azzouazi, Mohamed Belkasmi, Mostafa Bellfkih, El Mehdi Benghazouani, Salsabila Bennane, Abdellah Chemseddine Idrissi, Imrane El Assad, Mohammed El Kasmi Alaoui, Seddiq Haloum, Ihsane Jebbar, Mostafa Louartiti, Khalid Mouline, Jamal Rafiq, Jamal Eddine Zakrani, Abdelali