Samir BALBAL

Mr. Samir BALBAL

1 Department of Computer Science, Ferhat Abbas University Sétif 1

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

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

Representative Publications

View All Publications
31 May 2021 in Algorithms
Verified
Journal Article
Open access
PDF file
Samir BALBALSamir BALBAL
Samir BALBAL
Salim BouamamaSalim Bouamama
Salim Bouamama
CBChristian Blum
Christian Blum
Dominating sets are among the most well-studied concepts in graph theory, with many real-world applications especially in the area of wireless sensor networks. One way to increase network lifetime in wireless sensor networks consists of assigning sensors to disjoint dominating node sets, which are then sequentially used by a sleep–wake cycling mechanism. This paper presents a greedy heuristic for solving a weighted version of the maximum disjoint dominating sets problem for energy conservation purposes in wireless sensor networks. Moreover, an integer linear programming model is presented. Experimental results based on a large set of 640 problem instances show, first, that the integer linear programming model is only useful for small problem instances. Moreover, they show that our algorithm outperforms recent local search algorithms from the literature with respect to both solution quality and computation time.

1 January 2015 in International Journal of Intelligent Information Systems
Verified
Journal Article
Open access
PDF file
Samir BALBALSamir BALBAL
Samir BALBAL
YLYacine Laalaoui
Yacine Laalaoui
BMBenyettou Mohamed
Benyettou Mohamed
In this paper we will present a heuristic method to solve the Multiple Knapsack Problem. The proposed method is an improvement of the IRT heuristic described in [2].the experimental study shows that our improvement leads some gain in time and solution quality against IRT, MTHM, Mulknap and ILOG CPLEX.

26 September 2025 in International Journal of Computational and Experimental Science and Engineering
Verified
Journal Article
Open access
PDF file
SBSonia Bessaoudi
Sonia Bessaoudi
LTLyazid Toumi
Lyazid Toumi
Samir BALBALSamir BALBAL
Samir BALBAL
The Materialized View Selection (MVS) problem is a critical NP-complete challenge in data warehouse design, aimed at optimizing query performance while balancing storage and maintenance costs. This paper proposes BChOMVS, a novel metaheuristic approach that utilizes a Binary Chimp Optimization Algorithm (BChO) to efficiently identify near-optimal view sets. Using the Multiple View Processing Plan (MVPP) for view representation, BChOMVS encodes solutions as binary vectors and evaluates them with a comprehensive cost model. Rigorous experimental evaluation on the TPC-H benchmark up to 50GB demonstrates that BChOMVS significantly outperforms state-of-the-art methods like ACOMVS, PSOMVS, and GTMVS. It achieves superior total cost reduction by consistently selecting the smallest, most impactful view sets, establishing itself as the premier choice for large-scale data warehouse optimization where ultimate cost minimization is paramount.

8 August 2026 in Statistics, Optimization & Information Computing
Verified
Journal Article
Open access
PDF file
YBYoussef Boulkhiout
Youssef Boulkhiout
Samir BALBALSamir BALBAL
Samir BALBAL
KNKhaled Nasri
Khaled Nasri
AMAbdelouahab Moussaoui
Abdelouahab Moussaoui
The rapid growth of the Internet of Things (IoT) has significantly expanded the attack surface of modern networks, generating an urgent need for robust and efficient intrusion detection mechanisms. Machine learning (ML) is a promising approach to detect cyber attacks in IoT environments by automatically learning discriminative patterns from heterogeneous, real-world traffic. In this work we provide a comparative review and a thorough empirical evaluation of ten classifiers: logistic regression, decision trees, k-nearest neighbors, support vector machines, multilayer perceptrons, Random Forests, XGBoost, LightGBM, CatBoost, and a soft-voting ensemble on the RT-IoT2022 dataset, a realistic benchmark for real-time IoT attack detection. In addition to raw performance, we measure the impact of aggressive dimensionality reduction by comparing the full 83-feature space to a compact subset of 15 features, as determined by the consensus ranking of LightGBM and CatBoost feature importances. Experiments indicate that tree-based ensembles, CatBoost, XGBoost, and LightGBM, achieve the best performance, producing accuracy and AUC values above 99.7% and 99.9%, respectively, for both feature configurations, while maintaining balanced precision and recall across different attack types. Among the non-ensemble models, k-nearest neighbours is the strongest and loses only 0.05 accuracy points under the reduction, and the multilayer perceptron is equally insensitive, whereas logistic regression and the linear SVM lose 16--17 macro-F1 points. All comparisons are supported by stratified five-fold cross-validation, 95% confidence intervals and paired McNemar and Wilcoxon tests under Holm--Bonferroni correction, by a deployment cost profile (training and per-flow inference time), by a per-class analysis of minority-attack recall after SMOTE, and by external validation on NSL-KDD. This paper summarizes the advantages, disadvantages, and deployment considerations of state-of-the-art ML techniques and provides practical guidance for the development of adaptive, lightweight, and interpretable IoT intrusion detection systems.

21 October 2026 in Internet of Things
Verified
Journal Article
Closed access
YBYoussef Boulkhiout
Youssef Boulkhiout
LGLakhdar Goudjil
Lakhdar Goudjil
Samir BALBALSamir BALBAL
Samir BALBAL
KNKhaled Nasri
Khaled Nasri