Nour Elislem Karabadji
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
Research Subjects
Nour Elislem Karabadji has a total of 38 co-authors. Here are the top co-authors by number of shared publications:
- Wajdi Dhifli
University of Lille, Lille, France
10 shared publications - Mohamed Elati
Univ. Lille, CNRS, Inserm, CHU Lille, UMR9020-U1277 – CANTHER – Cancer Heterogeneity Plasticity and Resistance to Therapies, Lille, France
6 shared publications - Ali Assi
Rochester Institute of Technology, Dubai, United Arab Emirates
5 shared publications - Abdelghani Lakhdari
Department of Mathematics, Faculty of Science and Arts, Kocaeli University, Umuttepe Campus, Kocaeli 41001, Türkiye
4 shared publications - Ahmed Al Nuaim
Department of Management Information Systems, School of Business, King Faisal University, Al Ahsa, Saudi Arabia
3 shared publications Hassina Seridi
3 shared publications
Latest Publications
- Open Access
- 8 August 2026
- Published by Elsevier in Information Fusion
- Vol. 138
Fractional class-specific weighted random forest optimization
- 8 August 2026
- Published by Elsevier in Information Fusion
- Vol. 138
Open AccessFractional class-specific weighted random forest optimization
- Open Access
- 15 May 2026
- Published by Elsevier in Knowledge-Based Systems
- Vol. 346
Improved VAE-GAN via mixture of Gaussians applied to brain tumor MRI classification
- 15 May 2026
- Published by Elsevier in Knowledge-Based Systems
- Vol. 346
Open AccessImproved VAE-GAN via mixture of Gaussians applied to brain tumor MRI classification
- Open Access
- 18 April 2026
- Published by Elsevier in SSRN Electronic Journal
Level-Wise Feature Weighting for Decision Tree Induction via Swarm Intelligence
Constructing optimal decision trees is an NP-complete problem. To address this challenge, we propose PSO-LWFWDT, a framework that reformulates tree induction as a continuous optimization problem. The proposed approach introduces a continuous level-wise feature-weighting mechanism optimized through Particle Swarm Optimization (PSO). Gini gain is dynamically modulated by these weights, while a hard-thresholding mechanism suppresses weak attributes, thereby enabling implicit depth-specific feature selection. The learning process is guided by a multi-objective fitness function that maximizes the weighted F1-score while penalizing tree depth, encouraging the induction of parsimonious trees without the need for post-pruning. An extensive evaluation on 30 benchmark datasets shows that PSO-LWFWDT achieves competitive or superior predictive performance compared with CART, Oblique Tree, and NCART, while maintaining controlled model complexity.
- 18 April 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessLevel-Wise Feature Weighting for Decision Tree Induction via Swarm Intelligence
Constructing optimal decision trees is an NP-complete problem. To address this challenge, we propose PSO-LWFWDT, a framework that reformulates tree induction as a continuous optimization problem. The proposed approach introduces a continuous level-wise feature-weighting mechanism optimized through Particle Swarm Optimization (PSO). Gini gain is dynamically modulated by these weights, while a hard-thresholding mechanism suppresses weak attributes, thereby enabling implicit depth-specific feature selection. The learning process is guided by a multi-objective fitness function that maximizes the weighted F1-score while penalizing tree depth, encouraging the induction of parsimonious trees without the need for post-pruning. An extensive evaluation on 30 benchmark datasets shows that PSO-LWFWDT achieves competitive or superior predictive performance compared with CART, Oblique Tree, and NCART, while maintaining controlled model complexity.
- Open Access
- 25 February 2026
- Published by Elsevier in ICT Express
Multi-group overlapping weighted random forests
- 25 February 2026
- Published by Elsevier in ICT Express
Open AccessMulti-group overlapping weighted random forests
- Open Access
- 18 January 2026
- Published by Elsevier in Expert Systems with Applications
- Vol. 309
Towards better random forests with tree weighting, accuracy and diversity-preserving pruning
- 18 January 2026
- Published by Elsevier in Expert Systems with Applications
- Vol. 309
Open AccessTowards better random forests with tree weighting, accuracy and diversity-preserving pruning
- Open Access
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of the Communications Society
- Vol. 7, 10178-10192
A Lightweight Language-Model-Driven Agentic Framework for Intrusion Prediction, Detection, and Mitigation in 6G-Enabled IoT Networks
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of the Communications Society
- Vol. 7, 10178-10192
Open AccessA Lightweight Language-Model-Driven Agentic Framework for Intrusion Prediction, Detection, and Mitigation in 6G-Enabled IoT Networks
- Open Access
- 10 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 77-86
Learning Global-Local Multi-Scale Node Embeddings with Random Walks and Landmark-Guided Optimization
- 10 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 77-86
Open AccessLearning Global-Local Multi-Scale Node Embeddings with Random Walks and Landmark-Guided Optimization
- 13 August 2025
- Published by Springer Nature in Cluster Computing
- Vol. 28 (7) , 1-22
A genetic and graph-guided feature learning strategy for improving decision tree construction
- 13 August 2025
- Published by Springer Nature in Cluster Computing
- Vol. 28 (7) , 1-22
A genetic and graph-guided feature learning strategy for improving decision tree construction
- Open Access
An Extension of Left Radau Type Inequalities to Fractal Spaces and Applications
In this study, we introduce a novel local fractional integral identity related to the Gaussian two-point left Radau rule. Based on this identity, we establish some new fractal inequalities for functions whose first-order local fractional derivatives are generalized convex and concave. The obtained results not only represent an extension of certain previously established findings to fractal sets but also a refinement of these when the fractal dimension is equal to one. Finally, to support our findings, we present a practical application to demonstrate the effectiveness of our results.Open AccessAn Extension of Left Radau Type Inequalities to Fractal Spaces and Applications
In this study, we introduce a novel local fractional integral identity related to the Gaussian two-point left Radau rule. Based on this identity, we establish some new fractal inequalities for functions whose first-order local fractional derivatives are generalized convex and concave. The obtained results not only represent an extension of certain previously established findings to fractal sets but also a refinement of these when the fractal dimension is equal to one. Finally, to support our findings, we present a practical application to demonstrate the effectiveness of our results. - 19 April 2023
- Published by Elsevier in Expert Systems with Applications
- Vol. 225
Accuracy and diversity-aware multi-objective approach for random forest construction
- 19 April 2023
- Published by Elsevier in Expert Systems with Applications
- Vol. 225
Accuracy and diversity-aware multi-objective approach for random forest construction