Article Per Year (5 Year)
p-Index From 2021 - 2026
5.045
P-Index
This Author published in this journals
All Journal Jurnal Teknologi dan Manajemen Informatika CommIT (Communication & Information Technology) Jurnal TIMES Sinkron : Jurnal dan Penelitian Teknik Informatika JIKO (Jurnal Informatika dan Komputer) Kinetik: Game Technology, Information System, Computer Network, Computing, Electronics, and Control JOURNAL OF APPLIED INFORMATICS AND COMPUTING METHOMIKA: Jurnal Manajemen Informatika & Komputerisasi Akuntansi Jiko (Jurnal Informatika dan komputer) JURIKOM (Jurnal Riset Komputer) JURTEKSI Building of Informatics, Technology and Science Jurnal Sistem Komputer dan Informatika (JSON) Jurnal Ilmiah Smart Journal of Applied Computer Science and Technology (JACOST) Bulletin of Computer Science Research Journal of Artificial Intelligence and Engineering Applications (JAIEA) Majalah Ilmiah METHODA TAMIKA: Jurnal Tugas Akhir Manajemen Informatika & Komputerisasi Akuntansi Journal of Computing Theories and Applications QOSIM: Jurnal Pendidikan, Sosial & Humaniora Jurnal Ilmiah Smart Jurnal Ilmiah Teknik Mesin, Elektro dan Komputer
Robet Robet
STMIK TIME
Religion Agriculture, Biological Sciences & Forestry Humanities Automotive Engineering Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Economics, Econometrics & Finance Education Electrical & Electronics Engineering Energy Engineering Languange, Linguistic, Communication & Media Mechanical Engineering Medicine & Pharmacology Public Health Social Sciences

Published : 46 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 46 Documents
Search

 1   2   3   4   5 
Implementasi Chatbot Otomatis Akademik Berbasis Web Menggunakan LLM dan Rule-Based System Studi Kasus: STMIK Time Alvin, Alvin; Robet, Robet; Tarigan, Feriani Astuti
JURNAL INFORMATIKA DAN KOMPUTER Vol 9, No 3 (2025): Oktober 2025
Publisher : Lembaga Penelitian dan Pengabdian Masyarakat - Universitas Teknologi Digital Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26798/jiko.v9i3.2209

Abstract

Perkembangan teknologi kecerdasan buatan (Artificial Intelligence/AI) telah mendorong peningkatan efisiensi layanan informasi melalui penerapan chatbot yang mampu berinteraksi secara alami dengan pengguna. Chatbot merupakan implementasi teknologi berbasis pemrosesan bahasa alami (Natural Language Processing/NLP) yang dirancang untuk memahami dan merespons percakapan manusia. Penelitian ini bertujuan mengembangkan chatbot otomatis layanan akademik STMIK Time berbasis web dengan mengintegrasikan dua pendekatan utama, yaitu Rule-Based System dan Large Language Model (LLM). Metode penelitian meliputi tahap perancangan sistem menggunakan Flowise AI sebagai platform automation workflow, serta pengujian performa sistem melalui dua tahap, yaitu pengujian black box untuk menilai fungsionalitas dan pengujian user experience untuk mengukur persepsi pengguna terhadap kecepatan, akurasi, dan kepuasan. Hasil pengujian menunjukkan bahwa chatbot berfungsi dengan baik dengan capaian kecepatan respons sebesar 51,5%, tingkat akurasi 54,5%, dan tingkat kepuasan pengguna 60,6%. Hasil ini menegaskan bahwa sistem mampu memberikan layanan informasi akademik secara efektif, meskipun aspek kecepatan dan responsivitas masih perlu ditingkatkan. Kesimpulannya, Rule-Based System lebih sesuai untuk percakapan terstruktur, sedangkan Large Language Model (LLM) lebih efektif untuk konteks dinamis. Penelitian ini diharapkan menjadi dasar pengembangan layanan akademik berbasis AI yang lebih adaptif dan responsif di perguruan tinggi.
Comparative Analysis of DNA Sequence Alignment Algorithms in SARS-CoV-2 Edi, Edi; Robet, Robet; Harahap, Nurhayati
Sinkron : jurnal dan penelitian teknik informatika Vol. 9 No. 4 (2025): Articles Research October 2025
Publisher : Politeknik Ganesha Medan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33395/sinkron.v9i4.15323

Abstract

Sequence alignment is fundamental in bioinformatics, with Smith-Waterman (local) and Needleman-Wunsch (global) algorithms widely applied. However, comparative analyses on highly similar viral genomes such as SARS-CoV-2 remain scarce. This study systematically evaluated both algorithms using the first 5,000 nucleotides of two SARS-CoV-2 genomes (29,903 and 29,684 nt) under four parameter configurations: standard, low gap penalty, high gap penalty, and high match reward. Performance was assessed through alignment score, sequence identity, gap distribution, execution time, and parameter sensitivity. Both algorithms produced identical sequence identity (97.80%), with 4,943 matches out of 5,054 positions. Smith-Waterman consistently yielded higher alignment scores (12.6-112 points advantage), while Needleman-Wunsch was substantially faster (0.7752 vs 3.9014 s), showing 5.03 times greater computational efficiency. These findings indicate that both methods are reliable for highly similar viral sequences, with a trade-off between scoring precision and computational speed. This study provides the first parameter-sensitive comparison for full SARS-CoV02 genomes, emphasizing how parameter tuning can influence performance outcomes. A key limitation is that the analysis was restricted to the first 5,000 nucleotides, which may not capture variability across the complete genome.
A Comparative Study of Machine Learning and Deep Learning Models for Heart Disease Classification Simanjuntak, Martina Sances; Robet, Robet; Hoki, Leony
Journal of Applied Informatics and Computing Vol. 9 No. 6 (2025): December 2025
Publisher : Politeknik Negeri Batam

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30871/jaic.v9i6.11546

Abstract

Heart disease remains one of the leading causes of mortality worldwide, necessitating accurate early detection. This study aims to compare the performance of several Machine Learning (ML) and Deep Learning (DL) algorithms in heart disease classification using the Heart Disease dataset with 918 samples. The methods tested included Naïve Bayes, Decision Tree, Random Forest, Support Vector Machine (SVM), Logistic Regression, K-Nearest Neighbor (KNN), and Deep Neural Network (DNN). Preprocessing included feature normalization, data splitting (80:20), and simple hyperparameter tuning for parameter-sensitive models. Evaluations were conducted using accuracy, precision, recall, F1-score, AUC, and confusion matrix analysis to identify error patterns. The results showed that SVM and DNN achieved the highest accuracies of 91.3% and 92.1%, respectively. However, DNN has higher computational costs and risks of overfitting on small datasets. These findings confirm that traditional ML models such as SVM remain highly competitive on tabular medical data.
Comparative Analysis of Loss Functions for Predicting Autoimmunity from Molecular Descriptors Using Deep Learning Gunawan, Candra; Robet, Robet; Hendri, Hendri
Building of Informatics, Technology and Science (BITS) Vol 7 No 3 (2025): December 2025
Publisher : Forum Kerjasama Pendidikan Tinggi

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47065/bits.v7i3.8581

Abstract

Drug-induced autoimmunity (DIA) presents a complex obstacle in pharmacological safety due to its rare occurrence and unpredictable manifestation, often compounded by class imbalance in clinical datasets. This study investigates the influence of three loss functions, Binary Cross-Entropy (BCE), Focal Loss, and Dice Loss, on the performance of deep learning architectures comprising Multi-Layer Perceptron (MLP), Convolutional Neural Network (CNN), and 2-Layer Neural Network (SimpleNN). Models were trained using numerical molecular descriptors from the publicly available DIA dataset. The architectures were chosen based on their complementary properties: MLP is suitable for high-dimensional tabular descriptor data, CNN was examined to explore whether 1D convolutions can capture localized feature interactions among correlated descriptors, and 2-Layer Neural Network served as a lightweight baseline for comparison. A stratified 5-fold cross-validation strategy was employed to ensure statistical robustness. The results demonstrate that the MLP model, optimized with Focal Loss, consistently delivered the highest classification performance, achieving average scores of 94% accuracy, 93% precision, 95% recall, 94% F1-score, and an AUC of 0.97. In contrast, CNN and SimpleNN architectures yielded less favorable outcomes under the same loss configurations. These findings highlight the importance of aligning loss function choice with model complexity in the context of imbalanced biomedical data. The insights from this work contribute to the development of more reliable computational frameworks for early-phase immunogenicity screening and support the advancement of precision pharmacovigilance strategies.
COMPARISON OF DECISION TREE AND RANDOM FOREST ALGORITHMS FOR ASTHMA Lase, Wisriani; Robet, Robet; Hendri, Hendri
JURTEKSI (jurnal Teknologi dan Sistem Informasi) Vol. 12 No. 1 (2025): Desember 2025
Publisher : Lembaga Penelitian dan Pengabdian Kepada Masyarakat (LPPM) STMIK Royal Kisaran

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33330/jurteksi.v12i1.4192

Abstract

Abstract: Asthma is a chronic respiratory disease that affects millions of people worldwide, making early detection crucial to prevent complications. This study aims to compare the performance of the Decision Tree and Random Forest algorithms in classifying asthma based on clinical symptom data. The data were processed through feature selection and model training stages, then evaluated using accuracy, precision, recall, and F1-score.The experimental analysis revealed that the Random Forest algorithm surpassed the Decision Tree in all metrics, achieving 95.19% accuracy, 90.43% precision, 95.00% recall, and 93.00% F1-score. In contrast, the Decision Tree obtained 89.14% accuracy, 90.60% precision, 88.70% recall, and 89.70% F1-score. These results suggest that Random Forest is more robust and dependable, especially in managing complex and imbalanced medical datasets. Keywords: asthma detection; decision tree; random forest; machine learning. Abstrak: Asma merupakan penyakit pernapasan kronis yang memengaruhi jutaan orang di seluruh dunia sehingga deteksi dini sangat penting untuk mencegah komplikasi. Penelitian ini bertujuan membandingkan kinerja algoritma Decision Tree dan Random Forest dalam mengklasifikasikan asma berdasarkan data gejala klinis. Data diproses melalui tahapan seleksi fitur dan pelatihan model, kemudian dievaluasi menggunakan akurasi, presisi, recall, dan F1-score. Hasil penelitian menunjukkan bahwa Random Forest memberikan performa terbaik dengan akurasi 90.43%, presisi 95.00%, recall 95.00%, dan F1-score 93.00%. Sebaliknya, Decision Tree memperoleh akurasi 89.14%, presisi 90.60%, recall 88.70%, dan F1-score 89.70%. Hasil ini menunjukkan bahwa Random Forest lebih kuat dan dapat diandalkan, terutama dalam mengelola kumpulan data medis yang kompleks dan tidak seimbang. Kata kunci: deteksi asma; decision tree; random forest; pembelajaran mesin.
Comparative Analysis of XGBoost, KNN, and SVM Algorithms for Heart Disease Prediction Using SMOTE-Tomek Balancing Yuliana, Yuliana; Robet, Robet; Hoki, Leony
Sinkron : jurnal dan penelitian teknik informatika Vol. 10 No. 1 (2026): Article Research January 2026
Publisher : Politeknik Ganesha Medan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33395/sinkron.v10i1.15469

Abstract

Heart disease remains one of the leading causes of death worldwide, making early detection crucial for improving patient outcomes. This study aims to evaluate and compare the performance of several machine learning algorithms in detecting heart disease using the 2015 BRFSS dataset, which includes responses from 253,680 individuals. The three algorithms examined are Extreme Gradient Boosting (XGBoost), K-Nearest Neighbors (KNN), and Support Vector Machine (SVM). The data preprocessing steps involved feature encoding, class imbalance handling using the Synthetic Minority Over-sampling Technique combined with Tomek Links (SMOTE-Tomek), and hyperparameter tuning through RandomizedSearchCV. The models were assessed on a hold-out validation set using several metrics, including accuracy, Receiver Operating Characteristic-Area Under the Curve (ROC-AUC), F1-score, precision, and recall. The results demonstrated that XGBoost achieved the highest performance, with an accuracy of 94%, a ROC-AUC score of 0.98, and an F1-score of 0.94. In comparison, KNN achieved an accuracy of 87% (ROC-AUC 0.95), while SVM attained an accuracy of 79% (ROC-AUC 0.86). These findings suggest that XGBoost is a robust model for large-scale heart disease classification and holds potential for implementation in clinical decision support systems.
IoT Sensor Data Analysis for Early Fire Detection Using Dynamic Threshold Br Tarigan, Widia; Robet, Robet; Tarigan, Feriani Astuti
Sinkron : jurnal dan penelitian teknik informatika Vol. 10 No. 1 (2026): Article Research January 2026
Publisher : Politeknik Ganesha Medan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33395/sinkron.v10i1.15478

Abstract

Early fire detection using Internet of Things (IoT) technology plays a vital role in minimizing potential material losses and casualties. Conventional systems generally still rely on static thresholds that are less adaptive to environmental dynamics, leading to high false alarm rates and delayed detection. This study proposes a dynamic threshold approach based on a hybrid method of Fuzzy Logic–Random Forest–Adaptive Z-Score and compares it with the static threshold method. Testing was conducted using publicly available secondary datasets, and the algorithms were implemented and tested in Jupyter Notebook. Evaluation was performed using accuracy, false alarm rate (FAR), detection time, F1-score, precision, and recall metrics. The test results show that the dynamic threshold method provides better performance with an increase in accuracy from 59.5% to 74.8%, a decrease in FAR from 31.1% to 14.3%, and a reduction in detection time from 21 seconds to 0 seconds. In addition, the F1-score increased from 0.459 to 0.638, precision from 0.473 to 0.716, and recall from 0.446 to 0.575. These results show that the dynamic threshold approach is more adaptive and reliable in IoT-based fire detection systems than conventional static threshold methods.
Comparison of XGBoost and Naive Bayes Models in Type 2 Diabetes Prediction with RFE Feature Selection Barus, Hanisa putri; Robet; Feriani Astuti Tarigan
Sinkron : jurnal dan penelitian teknik informatika Vol. 10 No. 1 (2026): Article Research January 2026
Publisher : Politeknik Ganesha Medan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33395/sinkron.v10i1.15509

Abstract

Type 2 diabetes mellitus is a chronic disease with an increasing prevalence rate that can cause serious complications if not detected early. The application of machine learning algorithms can aid prediction, but selecting the right model and features greatly determines the accuracy of the results. This study aims to compare the performance of the Extreme Gradient Boosting (XGBoost) and Naive Bayes algorithms in predicting type 2 diabetes with and without Recursive Feature Elimination (RFE) feature selection. The data used were from the UCI Machine Learning Repository, comprising 768 samples and eight clinical features. The research process included data preprocessing, dividing the data into 614 training data and 154 testing data, applying RFE to select the most influential features, model training, and evaluation using accuracy, precision, recall, F1-score, and AUC. The results show that Naive Bayes without RFE achieves 70.77% accuracy, 0.57377 precision, 0.648148 recall, F1-score 0.608696, and 0.772778 AUC, while Naive Bayes with RFE increases the accuracy to 74.02% and the AUC to 0.793333. Meanwhile, XGBoost with RFE provided the best results with an accuracy of 74.67%, precision of 0.653061, recall of 0.592593, F1-score of 0.621359, and the highest AUC of 0.804259. Besides, applying RFE also improves the computational efficiency. These findings indicate that applying RFE significantly improves classification and computation time performance. The practical implication is that this model could aid early detection of diabetes in clinical settings. Further research can be conducted by optimizing parameters and using more diverse datasets.
Comparative Analysis of Four Machine Learning Algorithms for Smoke Detection Using SMOTE-Rebalanced Sensor Data Liecero, Marcus; Robet, Robet; Hendrik, Jackri
Sinkron : jurnal dan penelitian teknik informatika Vol. 10 No. 1 (2026): Article Research January 2026
Publisher : Politeknik Ganesha Medan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33395/sinkron.v10i1.15546

Abstract

Smoke detection plays a critical role in preventing fire-related hazards, particularly in intelligent monitoring and early warning systems. Conventional smoke sensors often exhibit limited responsiveness in dynamic environmental conditions, prompting the adoption of IoT-based sensor data combined with machine learning techniques. This study presents a comparative evaluation of four supervised classification algorithms, K-Nearest Neighbors (KNN), Decision Tree, Random Forest, and Gradient Boosting, using the Smoke Detection Dataset from Kaggle. The methodology integrates SMOTE to address class imbalance and Z-score normalization for feature standardization. Hyperparameter tuning was performed using GridSearchCV with 5-fold cross-validation, and model performance was assessed based on accuracy and execution time. Experimental results show that KNN achieved the highest accuracy (98.33%) with the lowest execution time (0.0327 s), whereas Decision Tree recorded the lowest accuracy (84.17%) but remained computationally fast (0.0406 s). Random Forest and Gradient Boosting demonstrated strong predictive capability (97.22% and 96.94%, respectively), but at higher computational costs (1.4338 s and 8.3819 s, respectively). Almost all models achieved perfect scores (1.00) for precision, recall, and F1-score following SMOTE-based balancing, except KNN which obtained slightly lower values (0.99). The findings indicate a trade-off between predictive performance and computational efficiency, suggesting that lightweight models such as KNN are better suited for real-time IoT-based smoke detection. In contrast, ensemble models may be more appropriate for backend analysis. This research contributes an integrated evaluation framework that combines data rebalancing, multi-model benchmarking, and time-based performance analysis, providing practical insights for the development of responsive and scalable early smoke detection systems.
Comparative Study of Baseline and CBAM-Enhanced ResNet50 and MobileNetV2 for Indonesian Rupiah Banknote Classification Alvin, Alvin; Robet, Robet; Feriani, Feriani Astuti Tarigan
Sinkron : jurnal dan penelitian teknik informatika Vol. 10 No. 1 (2026): Article Research January 2026
Publisher : Politeknik Ganesha Medan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33395/sinkron.v10i1.15558

Abstract

This study investigates the performance of Convolutional Neural Network (CNN) architectures enhanced with Convolutional Block Attention Module (CBAM) for Indonesian banknote classification. Although attention mechanisms have shown strong potential in improving fine-grained visual recognition, their effectiveness for the classification of banknotes with fine textures and similar color patterns remains underexplored, forming a key research gap addressed in this work. Four architectures, ResNet50, ResNet50+CBAM, MobileNetV2, and MobileNetV2+CBAM, were evaluated using K-Fold cross-validation on a dataset of 1,281 images representing seven banknote denominations. Experimental results show that ResNet50 achieves strong baseline performance with a weighted Train accuracy of 99.14% and a Val accuracy of 96.72%, while the integration of CBAM further improves feature discrimination, with ResNet50+CBAM obtaining the highest average accuracy across all folds with a weighted Train accuracy of 100% and a Val accuracy of 99.45%. MobileNetV2 showed lower performance due to its lightweight capacity with a Train accuracy of 91.88% and a decrease in Val accuracy of 85.71%. However, the addition of CBAM provided measurable improvements and greater stability with a Train accuracy of 99.61% and Val accuracy of 92.82%. Overall, CBAM improved CNN’s ability to focus on spatial information and salient channels, resulting in more reliable classification. ResNet50+CBAM emerged as the best-performing model, offering the best balance between accuracy and consistency. These findings support the development of reliable computer vision systems for financial technology applications, including automatic banknote recognition, counterfeit detection, and secure transaction verification.
Co-Authors Agus Maringan Siahaan Alvin Alvin, Alvin Andi Andi Andy Andy Ari Rizkita Arnold Adimabua Ojugo Barus, Hanisa putri Bayu Teta Bimo Haryo Setyoko Br Tarigan, Widia CANDRA GUNAWAN Carles Juliandy Chandra Chandra De Rosal Ignatius Moses Setiadi Didik Aryanto Donna Natalia edi edi Edi Wijaya Edi Wijaya Edi Wijaya Eferhire Valentine Ugbotu Etika Kartikadarma Feriani Astuti Tarigan Feriani Astuti Tarigan Feriani, Feriani Astuti Tarigan Haria Wirawan Hendri Hendri Hendri Hendri Hoki, Leony Hose, Fernando Jackri Hendrik Jenime Darwin Jerico Setiawan Johanes Terang Kita Perangin Angin Jonathan Kevin Fernando Juan Charles Kelvin Leonardi Kohsasih Lase, Wisriani Liecero, Marcus Md Kamruzzaman Sarker Michael Angelo Nicholas Tio Nurhayati Harahap Octara Pribadi Panjaitan, Tabitha Martha Agustine Perangin Angin, Johanes Poppy Amalia Putri, Jihan Hidayah Randy Wilson Rizkita, Ari Robin Robin Robin Robin, Robin Robin Zheng Satriya Miharja Siahaan, Agus Maringan Simanjuntak, Martina Sances Sinaga, Asra Gretya Siregar, Tarq Hilmar Suyud Widiono Suyud Widiono Tabitha Chukwudi Aghaunor Vic Devlin Yehezkiel E.A Parapak Yessica Yamin Yuliana Yuliana