cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
Fristi Riandari
Contact Email
hengkitamando26@gmail.com
Phone
+6281381251442
Journal Mail Official
hengkitamando26@gmail.com
Editorial Address
Romeby Lestari Housing Complex Blok C Number C14, North Sumatra, Indonesia
Location
Unknown,
Unknown
INDONESIA
Jurnal Mandiri IT
Published by Institute of Computer Science
ISSN : 23018984     EISSN : 28091884     DOI : https://doi.org/10.35335/mandiri
Core Subject : Science, Education,
Computer Science & IT Library & Information Science Mathematics
The Jurnal Mandiri IT is intended as a publication media to publish articles reporting the results of Computer Science and related research.
Arjuna Subject : Ilmu Komputer (semua kategori) - Kecerdasan Buatan
Articles 16 Documents
 1   2 
Search results for , issue "Vol. 14 No. 2 (2025): Computer Science and Field" : 16 Documents clear
Optimizing the performance of the K-Nearest Neighbors algorithm using grid search and feature scaling to improve data classification accuracy Manurung, Jonson; Saragih, Hondor; Prabukusumo, Muhammad Azhar; Firdaus, Eryan Ahmad
Jurnal Mandiri IT Vol. 14 No. 2 (2025): Computer Science and Field
Publisher : Institute of Computer Science (IOCS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35335/mandiri.v14i2.466

Abstract

The performance of distance-based classification algorithms such as K-Nearest Neighbors (KNN) is highly dependent on proper feature scaling and optimal parameter selection. Without systematic optimization, KNN may experience decreased accuracy due to feature scale disparities and suboptimal k-values. This study aims to enhance the performance of the KNN algorithm through the integration of Feature Scaling and Grid Search Cross-Validation as a parameter optimization strategy. The research employs the Breast Cancer Wisconsin Dataset, divided into 80% training and 20% testing data. Feature normalization was performed using StandardScaler, while Grid Search was applied to determine the optimal combination of parameters, including the number of neighbors (k), weighting function (weights), and distance metric (metric). The optimized KNN configuration with k = 9, weights = distance, and metric = manhattan achieved an average accuracy of 97.19%, outperforming the baseline accuracy of 93.86%. A paired t-test confirmed that the improvement was statistically significant (p < 0.05). These findings demonstrate that the synergy between feature scaling and parameter tuning can substantially improve both the accuracy and stability of KNN models. The scientific novelty of this study lies in the systematic integration of normalization and parameter optimization through Grid Search, providing an empirical framework that enhances KNN’s robustness across datasets with heterogeneous feature distributions. The proposed approach is recommended for medical data classification and can be adapted to other domains with heterogeneous numerical feature distributions.
Design of a web-based car rental service portal information system for 123 Lampung Utara Sari, Devika; Jihad, M. Abu
Jurnal Mandiri IT Vol. 14 No. 2 (2025): Computer Science and Field
Publisher : Institute of Computer Science (IOCS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35335/mandiri.v14i2.467

Abstract

This study aimed to design and implement a web-based car rental service information system for 123 Lampung Utara. The system was developed using the CodeIgniter framework with PHP as the programming language and MySQL as the database. The main features included vehicle category and data management, user registration and authentication, rental transactions, order status tracking, and transaction reporting in PDF format. The system was designed to enhance operational efficiency and customer satisfaction through the digitalization of the rental process. The development followed the Waterfall methodology and the Model-View-Controller (MVC) architecture. Black Box testing results showed that all system functions operated correctly according to predefined scenarios, and no critical bugs were found. Therefore, the system was deemed feasible for operational implementation and ready for further development through integration with a payment gateway and automated notification services.
Optimization of XGBoost hyperparameters using grid search and random search for credit card default prediction Firdaus, Eryan Ahmad; Manurung, Jonson; Saragih, Hondor; Prabukusumo, Muhammad Azhar
Jurnal Mandiri IT Vol. 14 No. 2 (2025): Computer Science and Field
Publisher : Institute of Computer Science (IOCS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35335/mandiri.v14i2.468

Abstract

This study explores the optimization of the Extreme Gradient Boosting (XGBoost) algorithm for credit card default prediction through systematic hyperparameter tuning using Grid Search and Random Search methodologies. Utilizing the publicly available Default of Credit Card Clients dataset from the UCI Machine Learning Repository, the research focuses on enhancing model performance by fine-tuning critical parameters such as learning rate, maximum tree depth, number of estimators, subsample ratio, and column sampling rate. The baseline XGBoost model achieved an accuracy of 0.8118, while the tuned models using Grid Search and Random Search improved the accuracy to 0.8183 and 0.8188, respectively. Although the improvement appears modest, the optimized models exhibited enhanced balance between precision and recall, particularly in identifying defaulters within an imbalanced dataset—an essential aspect in credit risk assessment. The results demonstrate that systematic hyperparameter optimization not only improves predictive performance but also contributes to model stability and generalization. Moreover, Random Search proved to be more computationally efficient, achieving near-optimal performance with fewer evaluations than Grid Search, thereby emphasizing its practicality for large-scale financial risk modeling applications. The novelty of this study lies in the comparative evaluation of two optimization techniques within the context of financial risk prediction, providing practical insights into how efficient hyperparameter tuning can enhance the reliability and scalability of machine learning models used in real-world credit risk management systems.
Hyperparameter optimization of graph neural networks for predicting complex network dynamics using bayesian meta-learning Saragih, Hondor; Manurung, Jonson; Prabukusumo, Muhammad Azhar; Firdaus, Eryan Ahmad
Jurnal Mandiri IT Vol. 14 No. 2 (2025): Computer Science and Field
Publisher : Institute of Computer Science (IOCS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35335/mandiri.v14i2.469

Abstract

The rapid growth of graph-structured data in domains such as transportation, social networks, and biological systems has increased the demand for more adaptive and efficient Graph Neural Network (GNN) architectures. However, GNN performance remains highly sensitive to hyperparameter configurations, which are often tuned through computationally expensive manual or heuristic methods. This study proposes a novel Bayesian Meta-Learning (BML)-based framework for hyperparameter optimization of GNNs aimed at improving the prediction accuracy of complex network dynamics. The framework integrates Bayesian optimization with a meta-learning prior adaptation mechanism, enabling the model to learn optimal hyperparameter distributions across multiple graph tasks. Experimental evaluations conducted on three benchmark datasets—Cora, Citeseer, and PubMed—comprising up to 20,000 nodes with diverse structural complexities, demonstrate that the proposed BML-GNN framework achieves faster convergence, lower validation loss, and higher predictive accuracy than both baseline GNN and traditional Bayesian Optimization approaches. Quantitatively, the BML-GNN model attains an R² score exceeding 0.97 with a significant reduction in RMSE, confirming its strong generalization capability. Although the method shows notable performance improvements, its computational overhead during meta-training and reliance on well-defined prior distributions represent potential limitations. Overall, the integration of Bayesian Meta-Learning provides a robust, scalable, and uncertainty-aware optimization strategy that advances the development of reliable GNN models for complex network modeling and intelligent system design.
Swarm driven automatic feature selection and classification framework for parkinson voice data Prabukusumo, Muhammad Azhar; Saragih, Hondor; Manurung, Jonson
Jurnal Mandiri IT Vol. 14 No. 2 (2025): Computer Science and Field
Publisher : Institute of Computer Science (IOCS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35335/mandiri.v14i2.470

Abstract

Parkinson’s disease (PD) severely impairs motor and vocal functions, and early detection is crucial for effective intervention. Conventional diagnostic procedures remain subjective and time-consuming, highlighting the need for automated, data-driven approaches. This study aims to develop an intelligent and fully automated framework integrating Particle Swarm Optimization (PSO)–based feature selection with ensemble machine learning classifiers for PD detection using voice data. The proposed Swarm-Driven Automatic Feature Selection and Classification Framework (SAFSCF) automates data preprocessing, adaptive feature optimization, and classification within a unified pipeline. The framework was evaluated on the Parkinson’s Speech Dataset comprising 743 numerical features. Baseline models achieved accuracies of 0.7738 (Logistic Regression), 0.8651 (Random Forest), and 0.8690 (Gradient Boosting). After PSO optimization, the feature set was reduced by nearly 50% to 382 attributes, achieving a test accuracy of 0.8421 slightly higher than the full-feature model (0.8355). Convergence plots confirmed that PSO effectively minimized the fitness function while maintaining high classification stability. Feature importance analysis revealed that the most discriminative attributes were derived from log energy, Teager Kaiser energy operators (TKEO), MFCCs, Shimmer, and entropy-based features biomarkers known to reflect Parkinsonian speech degradation. These findings demonstrate that the proposed framework enhances computational efficiency and interpretability, offering a reproducible and scalable solution for non-invasive, voice-based PD diagnosis.
Sentiment analysis of the 2024 election using the naïve bayes method using data x Zidan, Ahmad Halim Faizal; Handayani, Irma; Anggara, Afwan
Jurnal Mandiri IT Vol. 14 No. 2 (2025): Computer Science and Field
Publisher : Institute of Computer Science (IOCS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35335/mandiri.v14i2.471

Abstract

Text mining is a process for utilizing the vast amounts of data generated in today’s digital era. The rapid growth of social media usage has produced extensive textual data, one of which can be analyzed through sentiment analysis. This study uses the social media platform X to analyze public opinions regarding the 2024 Indonesian General Election. The analysis was conducted using 126 user comments as the dataset and 103 reviews as the testing data, which were then processed using the Naive Bayes method. Text mining with the Naive Bayes algorithm can be applied to examine public opinions and sentiments toward the 2024 election on X. The results of the analysis classify sentiments into positive, negative, and neutral categories.

Page 2 of 2 | Total Record : 16

 1   2 

Filter by Year

2025 2025


Reset
Filter By Issues
All Issue Vol. 14 No. 2 (2025): Computer Science and Field Vol. 14 No. 2 (2025): October: Computer Science and Field Vol. 14 No. 1 (2025): July: Computer Science and Field. Vol. 13 No. 4 (2025): April: Computer Science and Field. Vol. 13 No. 3 (2025): January: Computer Science and Field. Vol. 13 No. 2 (2024): CALL FOR PAPER !!! Scope Computer Science Vol. 13 No. 1 (2024): July: Computer Science and Field Vol. 12 No. 4 (2024): April: Computer Science and Field. Vol. 12 No. 3 (2024): January: Computer Science and Field. Vol. 12 No. 2 (2023): October: Computer Science and Field. Vol. 12 No. 1 (2023): July: Computer Science and Field. Vol. 11 No. 4 (2023): April : Computer Science and Field. Vol. 11 No. 3 (2023): January: Computer Science and Field. Vol. 11 No. 2 (2022): October: Computer Science and Field. Vol. 11 No. 1 (2022): July: Computer Science and Field. Vol. 10 No. 2 (2022): January: Computer Science and Field. Vol. 10 No. 1 (2021): July: Computer Science and Field. Vol. 9 No. 2 (2021): January: Computer Science and Field. Vol. 9 No. 1 (2020): July: Computer Science and related. Vol. 8 No. 2 (2020): January: Coputer Science and related. More Issue