Claim Missing Document
Check
Articles

Found 36 Documents
Search

Sistem Pendukung Keputusan Penilaian Kinerja Pegawai RSUD Dr. Hadrianus Sinaga Dengan Menggunakan Metode Multi Factor Evaluation Process: Sistem Pendukung Keputusan Penilaian Kinerja Pegawai RSUD Dr. Hadrianus Sinaga dengan Menggunakan Metode Multi Factor Evaluation Process Kanur L. P. Situmorang; Manurung, Jonson
Jurnal Teknik Informatika UNIKA Santo Thomas Vol 6 No. 2 : Tahun 2021
Publisher : LPPM UNIKA Santo Thomas

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (279.495 KB) | DOI: 10.54367/jtiust.v6i2.1557

Abstract

Rumah Sakit Umum Daerah (RSUD) DR. Hadrianus Sinaga setiap tahunnya memberikan penghargaan kepada pegawai yang berprestasi. Dalam proses penilaian pegawai berprestasi masih secara manual dan sangat tidak efektif, sehingga dirasa kurang optimal dan memerlukan banyak waktu baik dalam menyusun laporan maupun proses memutuskan calon pegawai berprestasi. Untuk menyelesaikan persoalan tersebut, maka diperlukan suatu Sistem Pendukung Keputusan (SPK) untuk menbantu pihak rumah sakit dalam memilih pegawai yang berkualitas dan berpretasi. Dalam pengambilan keputusan, metode yang dipakai dalam SPK ini adalah Multi Factor Evalution Process (MFEP). Pada metode MFEP ini pengambilan keputusan dilakukan dengan memberikan pertimbangan subjektif dan intuitif terhadap faktor yang dianggap penting. Pertimbangan tersebut berupa pemberiaan bobot atas multifactor yang terlibat dan dianggap penting. Aplikasi yang digunakan dalam pembuatan sistem ini adalah bahasa pemprogramana PHP untuk pembuatan programnya dan MySql untuk pembuatan database. Dengan menggunakan sistem pendukung keputusan ini, pemilihan pegawai berprestasi pada RSUD DR. Hadrianus Sinaga menjadi lebih efektif dan efisien serta menutup kemungkinan terjadinya kecurangan. Dari hasil pengujian system dan hasil analisa data bahwa A8 (Sumihar Tamba) mendapat nilai tertinggi dengan Bobot Evaluasi 81 dan Paling rendah A4 (Lenni Simbolon) dengan Bobot Evaluasi 70,75
Optimization of quicksort algorithm for real-time data processing in IoT systems with random pivot division and tail recursion Laia, Firdaus; Wau, Ferdinand Tharorogo; Manurung, Jonson
Jurnal Mandiri IT Vol. 14 No. 1 (2025): July: Computer Science and Field.
Publisher : Institute of Computer Science (IOCS)

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

Abstract

Real-time data processing in Internet of Things (IoT) systems requires efficient sorting algorithms to handle large and ever-increasing volumes of data. The QuickSort algorithm is often used due to its speed and efficiency, but on large pre-sorted datasets, this algorithm can experience performance degradation due to poor pivot selection and the use of regular recursion. This study aims to optimize the QuickSort algorithm through random pivot selection and the application of tail recursion to improve sorting efficiency on IoT datasets. Experiments were conducted by comparing the standard QuickSort version and the optimized version, using synthetic and real-time IoT datasets from temperature and humidity sensors. Performance evaluation was based on execution time and memory usage metrics. The results show that QuickSort with random pivot and tail recursion can reduce execution time by up to 27% and memory usage by up to 18% compared to the standard QuickSort implementation. These findings indicate that the proposed algorithm is more efficient for IoT applications that require real-time data processing, and has the potential to be applied in distributed data systems and parallel processing for large-scale scenarios.
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.
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.