Abdelmadjid Benmachiche

Prof. Abdelmadjid Benmachiche

orcid

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

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

Representative Publications

View All Publications
5 August 2025 in Future Internet
Verified
Journal Article
Open access
PDF file
SBSoundes Oumaima Boufaida
Soundes Oumaima Boufaida
ABAbdelmadjid Benmachiche
Abdelmadjid Benmachiche
MDMakhlouf DERDOUR
Makhlouf DERDOUR
MMMajda Maatallah
Majda Maatallah
Moustafa Sadek KAHILMoustafa Sadek KAHIL
Moustafa Sadek KAHIL
Mohamed Chahine GhanemMohamed Chahine Ghanem
Mohamed Chahine Ghanem
E-Learning is an emerging dominant phenomenon in education, making the development of robust models that can accurately represent the dynamic behavior of learners in MOOCs even more critical. In this article, we propose the Temporal Sparse Attention-Gated Recurrent Unit (TSA-GRU), a novel deep learning framework that combines TSA with a sequential encoder based on the GRU. This hybrid model effectively reconstructs student response times and learning trajectories with high fidelity by leveraging tthe emporal embeddings of instructional and feedback activities. By dynamically filtering noise from student interactions, TSA-GRU generates context-aware representations that seamlessly integrate both short-term fluctuations and long-term learning patterns. Empirical evaluation on the 2009–2010 ASSISTments dataset demonstrates that TSA-GRU achieved a test accuracy of 95.60% and a test loss of 0.0209, outperforming Modular Sparse Attention-Gated Recurrent Unit (MSA-GRU), Bayesian Knowledge Tracing (BKT), Performance Factors Analysis (PFA), and TSA in the same experimental design. TSA-GRU converged in five training epochs; thus, while TSA-GRU is demonstrated to have strong predictive performance for knowledge tracing tasks, these findings are specific to the conducted dataset and should not be implicitly regarded as conclusive for all data. More statistical validation through five-fold cross-validation, confidence intervals, and paired t-tests have confirmed the robustness, consistency, and statistically significant superiority of TSA-GRU over the baseline model MSA-GRU. TSA-GRU’s scalability and capacity to incorporate a temporal dimension of knowledge can make it acceptably well-positioned to analyze complex learner behaviors and plan interventions for adaptive learning in computerized learning systems.

18 January 2025 in Education and Information Technologies
Verified
Journal Article
Closed access
PDF file
ABAbdelmadjid Benmachiche
Abdelmadjid Benmachiche
ASAbdelhadi Sahia
Abdelhadi Sahia
SBSoundes Oumaima Boufaida
Soundes Oumaima Boufaida
KRKhadija Rais
Khadija Rais
MDMakhlouf DERDOUR
Makhlouf DERDOUR
FMFaiz Maazouzi
Faiz Maazouzi

15 September 2025 in Sensors
Verified
Journal Article
Open access
PDF file
ABAbdelmadjid Benmachiche
Abdelmadjid Benmachiche
MDMakhlouf DERDOUR
Makhlouf DERDOUR
Moustafa Sadek KAHILMoustafa Sadek KAHIL
Moustafa Sadek KAHIL
Mohamed Chahine GhanemMohamed Chahine Ghanem
Mohamed Chahine Ghanem
MDMohamed Deriche
Mohamed Deriche
The field of autonomous robotics is progressing rapidly, with research moving toward developing systems capable of moving without direct human control and learning without human intervention. One of the problems requiring an efficient and sustainable solution is ensuring the smooth and safe navigation of robots between obstacles. In this study, a new path planning approach is developed, integrating particle swarm optimization (PSO) and artificial potential field (APF) algorithms to assist the mobile robot in navigating an area with static and dynamic obstacles. The robot moves independently while routing dynamically and avoiding obstacles. To evaluate its adaptive ability to a changing environment, we continuously calculate the shortest distance between two points and dynamically adjust the path to avoid obstacles during replanning, path recalculation, and robot position adjustment to ensure efficient and safe navigation. Different scenarios are tested to evaluate our approach, including different environmental conditions and obstacle configurations. Experimental results show that our method reduces the path length by 18%, the obstacle avoidance efficiency by 90%, and the success rate by 85% in dynamic environments. In addition, PSO-APF reduces computation time, demonstrating better capacity and efficiency.

25 July 2025 in SN Computer Science
Verified
Journal Article
Closed access
PDF file
IBINES Boutabia
INES Boutabia
ABAbdelmadjid Benmachiche
Abdelmadjid Benmachiche
Akram BennourAkram Bennour
Akram Bennour
ABAli Abdelatif Abdelatif Betouil
Ali Abdelatif Abdelatif Betouil
MDMakhlouf DERDOUR
Makhlouf DERDOUR
FGFahad Ghabban
Fahad Ghabban

4 September 2025 in SN Computer Science
Verified
Journal Article
Closed access
PDF file
BSBrahim Khalil Sedraoui
Brahim Khalil Sedraoui
ABAbdelmadjid Benmachiche
Abdelmadjid Benmachiche
Akram BennourAkram Bennour
Akram Bennour
AMAmina Makhlouf
Amina Makhlouf
MDMakhlouf DERDOUR
Makhlouf DERDOUR
FGFahad Ghabban
Fahad Ghabban

5 November 2024 in Informatica
Verified
Journal Article
Open access
PDF file
AMAmina Makhlouf
Amina Makhlouf
ABAbdelmadjid Benmachiche
Abdelmadjid Benmachiche
IBINES Boutabia
INES Boutabia
Over the past three decades, there has been considerable focus on determining path planning for mobile robots, aiming to find safe and efficient routes between starting points and destinations. Exploring various navigational techniques holds promise for broadening the scope of applications for autonomous mobile robots. This research introduces a novel navigation strategy by combining the Particle Swarm Optimization (PSO) method with the Bacteria Foraging Optimization Algorithm (BFO). Inspired by the foraging behavior of bacteria, particularly E. coli, this bio-inspired approach is utilized to optimize routes for mobile robots, harnessing the advantages of PSO. The primary objective is to establish routes that are both feasible and secure. The proposed model involves a robot that mimics bacteria behavior to identify the most optimal route within environments cluttered with obstacles, connecting an initial point to a designated destination. This approach is implemented and evaluated across various scenarios, demonstrating the effectiveness and potential of the proposed method.