SciRepID - Scientific Publication Search

Publication Search

41,520 articles from 397 journals · 1,447 citations tracked

Showing 1-6 of 6

Analytics

Devianto, Yudo; Saragih, Rusmin; Cahyana, Yana

Journal of Information Technology and Computer Science 2026 International Forum of Researchers and Lecturers

This research benchmarks multiple machine learning (ML) algorithms for large-scale loan default prediction using a real-world dataset of 255,000 borrower records, where default cases represent only ~9–12% of total observations. The study addresses the persistent gap in comparative analyses of ML models that balance predictive accuracy, interpretability, and computational efficiency for credit risk assessment. Six algorithmic families were evaluated Logistic Regression, Random Forest, XGBoost, LightGBM, CatBoost, Artificial Neural Networks (ANN), and Stacked Ensemble—using standardized preprocessing, hybrid imbalance handling (SMOTE, class weighting, under-sampling), and comprehensive evaluation metrics (AUC, F1, Recall, Precision, PR-AUC, and Brier Score). Empirical results show Logistic Regression achieved the highest AUC of 0.732, outperforming nonlinear models under the baseline configuration, while LightGBM attained perfect recall (1.0) but low precision (0.116), indicating over-prediction of defaults. Gradient boosting models demonstrated robust calibration (Brier ≈ 0.114–0.116) and the best computational efficiency, with LightGBM showing the fastest training and lowest memory use. CatBoost exhibited strong recall but the slowest computation, and ANN underperformed on tabular data (AUC ≈ 0.56). The Stacked Ensemble delivered balanced results with AUC = 0.664 and improved overall stability. These findings confirm that boosting-based models, particularly LightGBM and CatBoost, offer superior scalability and calibration, whereas Logistic Regression remains a valuable interpretable baseline. The study concludes that effective default prediction requires integrating rebalancing, calibration, and threshold optimization to enhance recall and operational deployment reliability in large-scale credit ecosystems.

Abubakar, Mustapha; Ibrahim, Yusuf; Ajayi, Ore-Ofe; Saminu, Sani Saleh

Journal of Computing Theories and Applications 2026 Universitas Dian Nuswantoro

The integration of Artificial Intelligence (AI) into precision agriculture has significantly improved plant disease recognition; however, many existing deep learning models remain computationally expensive and feature-redundant, limiting their deployment on low-power and edge devices. To address these limitations, this study proposes a lightweight framework for maize leaf disease recognition based on serial deep feature extraction, dimensionality reduction, and machine-learning–based classification. A pre-trained MobileNetV2 network is employed as a fixed feature extractor to obtain discriminative visual representations, while Principal Component Analysis (PCA) is applied to reduce feature dimensionality by approximately 76%, retaining 95% of the original variance and improving computational efficiency. The compressed features are subsequently classified using a Radial Basis Function Support Vector Machine (RBF-SVM), optimized via grid search and cross-validation. Experiments conducted on a four-class maize leaf disease dataset (Northern Leaf Blight, Common Rust, Gray Leaf Spot, and Healthy), with class imbalance handled during training, demonstrate that the proposed MobileNetV2–PCA–SVM pipeline achieves 97.58% accuracy, 96.60% precision, 96.59% recall, and 96.59% F1-score, outperforming the DenseNet201 + Bayesian-optimized SVM baseline (94.60%, 94.40%, 94.40%, and 94.40%, respectively). This improvement corresponds to a 2.98% accuracy gain, a 55% reduction in error rate, an 86% reduction in model parameters (20.31M to 2.75M), and an 85% reduction in model size (81 MB to 12 MB). These results indicate that the proposed framework provides a compact and efficient solution with strong potential for deployment in resource-constrained agricultural environments.

Anggit Wirasto; Khoirun Nisa; Titi Christiana

Intelligent Systems and Robotics 2026 Asosiasi Pengelola Jurnal Informatika dan Komputer Indonesia

The increasing adoption of collaborative robots in modern manufacturing environments requires reliable perception systems that can ensure both safety and operational efficiency during human–robot collaboration. This study proposes a CNN-based real-time computer vision system for object and human detection in shared robotic workspaces. The research focuses on developing and evaluating a single-stage deep learning detection model optimized for real-time performance while maintaining high detection accuracy. The proposed methodology includes dataset preparation, model training using transfer learning, real-time system implementation, and comprehensive performance evaluation. Experimental results demonstrate that the developed system achieves high detection accuracy, as reflected by strong precision, recall, and mean Average Precision (mAP) values, while maintaining low inference latency suitable for real-time operation. The system consistently operates above real-time frame-rate thresholds, ensuring timely perception updates required for safety-related decision-making in collaborative robotic environments. Graphical and quantitative analyses further confirm the stability of inference performance under dynamic interaction scenarios involving human movement and multiple objects. Compared with existing approaches, the proposed system provides a balanced trade-off between accuracy and computational efficiency, making it practical for deployment in safety-aware human–robot collaboration scenarios. Overall, the findings indicate that CNN-based real-time object detection systems can effectively support perception and situational awareness in collaborative robotics, contributing to safer and more efficient industrial automation.

Rinna Rachmatika; Kecitaan Harefa

Indonesian Journal of Infomatics 2026 Asosiasi Pengelola Jurnal Informatika dan Komputer Indonesia

Concept drift, the phenomenon where the statistical properties of data streams change over time, poses a significant challenge in machine learning, particularly for long term data streams. Traditional machine learning models, including batch learning and non-adaptive approaches, struggle to detect and adapt to these changes, leading to degraded performance and inaccurate predictions. This study proposes an adaptive computational model designed to detect and respond to concept drift using incremental learning techniques and statistical drift detection mechanisms. The model integrates an Adaptive Drift Detector (ADD) and Incremental Learning System, enabling real-time adjustments to data distribution changes. The model is evaluated across synthetic and real-world datasets, demonstrating its superior ability to detect abrupt, gradual, and recurring drifts compared to traditional models. Experimental results indicate that the adaptive model maintains high prediction accuracy, minimizes false positive rates, and reduces detection delays. Furthermore, the model performs well in resource-constrained environments, making it suitable for real-time applications such as healthcare prediction, fault detection, and IoT systems. Despite its promising performance, the study identifies challenges related to computational complexity and the model’s performance with imbalanced datasets and noisy data. Future research should focus on optimizing the model’s scalability, computational efficiency, and adaptability to more complex data types to ensure broader applicability in dynamic environments. This work contributes to advancing the detection and adaptation of concept drift, offering a robust solution for dynamic and evolving data streams.

Victor Marudut Mulia Siregar; Munji Hanafi

Cyber Security and Network Management 2026 Asosiasi Pengelola Jurnal Informatika dan Komputer Indonesia

The rapid proliferation of Internet of Things (IoT) devices across diverse industries has significantly increased the vulnerability of IoT edge networks to sophisticated cyber threats. Traditional intrusion detection systems (IDS), such as signature-based and anomaly-based approaches, are often insufficient in addressing the dynamic and evolving nature of these threats. This study proposes a hybrid intrusion detection system (IDS) framework that combines supervised machine learning (ML) techniques with deep reinforcement learning (DRL) to enhance detection performance in real-time, resource-constrained IoT environments. The proposed framework utilizes supervised learning for initial traffic classification and DRL for adaptive decision-making, enabling the system to continuously learn and optimize its detection policies based on new attack patterns. The hybrid approach significantly improves detection accuracy and reduces false positives when compared to conventional signature-based and single-model ML systems. In addition to improved detection capabilities, the framework's computational efficiency allows it to operate effectively within the constraints of IoT devices, ensuring that it is suitable for large-scale deployments. Benchmark evaluations using publicly available datasets, such as NSL-KDD, IoT-23, and BoT-IoT, show that the hybrid IDS framework outperforms traditional methods, providing a more robust and adaptive solution to cybersecurity challenges in IoT edge networks. The findings of this study suggest that combining machine learning with deep reinforcement learning offers a promising approach to secure IoT environments and address the limitations of existing IDS techniques. Future work will explore enhancing real-time adaptability, scalability, and the detection of zero-day attacks in evolving IoT ecosystems.

Dedy Tri Cahyono; Jaja Miharja

Programming and Algorithm Fundamentals 2026 Asosiasi Pengelola Jurnal Informatika dan Komputer Indonesia

This research focuses on the design and evaluation of a novel parallel graph optimization algorithm incorporating dynamic load balancing (DLB) to address inefficiencies in heterogeneous computing environments. Large-scale graph optimization problems, such as those in social networks, bioinformatics, and transportation systems, often suffer from computational imbalances when using traditional static load balancing approaches, leading to underutilized resources and prolonged execution times. The primary objective of this research is to develop an algorithm that can dynamically adjust workload distribution across processors, enhancing computational efficiency and scalability. The proposed method combines heuristic techniques, including region expansion and multilevel partitioning, with diffusive load balancing strategies to minimize inter-processor communication overhead. Experimental results demonstrate that the proposed algorithm reduces execution time by up to 40% compared to static methods, with optimized resource utilization and more balanced workload distribution. The scalability of the algorithm is also evident, as it adapts effectively to increasing problem sizes and processor counts. These findings suggest that dynamic load balancing is crucial for improving parallel graph optimization in real-world applications. Future work will focus on further enhancing the algorithm’s responsiveness to rapidly changing workloads and expanding its applicability to additional domains.