p-Index From 2021 - 2026
7.928
P-Index
This Author published in this journals
All Journal Jurnal Informatika Perspektif : Jurnal Ekonomi dan Manajemen Universitas Bina Sarana Informatika Jurnal Teknik Komputer AMIK BSI Paradigma Jurnal Pilar Nusa Mandiri Techno Nusa Mandiri : Journal of Computing and Information Technology JURNAL TEKNOLOGI DAN OPEN SOURCE IJID (International Journal on Informatics for Development) Jurnal Riset Informatika Journal of Information System, Applied, Management, Accounting and Research Jurnal Informatika Kaputama (JIK) JURSIMA (Jurnal Sistem Informasi dan Manajemen) JOURNAL OF INFORMATION SYSTEM RESEARCH (JOSH) Journal of Computer System and Informatics (JoSYC) JPM: JURNAL PENGABDIAN MASYARAKAT Jurnal Responsif : Riset Sains dan Informatika Bulletin of Computer Science Research Journal of Informatics Management and Information Technology KLIK: Kajian Ilmiah Informatika dan Komputer Computer Science (CO-SCIENCE) Reputasi: Jurnal Rekayasa Perangkat Lunak Jurnal Abdimas Komunikasi dan Bahasa Profitabilitas Indonesian Journal of Networking and Security - IJNS JUSTIN (Jurnal Sistem dan Teknologi Informasi) Jurnal Interkom : Jurnal Publikasi Ilmiah Bidang Teknologi Informasi dan Komunikasi J-Intech (Journal of Information and Technology) DEVICE : JOURNAL OF INFORMATION SYSTEM, COMPUTER SCIENCE AND INFORMATION TECHNOLOGY JEECS (Journal of Electrical Engineering and Computer Sciences) JURSIMA Sinergi: Jurnal Pengabdian Kepada Masyarakat Journal of Accounting Information System TEKNOSIA Bulletin of Informatics and Data Science Jurnal Sistem Informasi dan Manajemen Journal of Artificial Intelligence and Technology Information Journal of Information Technology, Software Engineering and Computer Science Help: Journal of Community Service (HJCS) Media Teknologi dan Informatika Darma Abdi Karya: Jurnal Pengabdian Kepada Masyarakat Jurnal Informatika dan Rekayasa Perangkat Lunak Jurnal Komtika (Komputasi dan Informatika) Journal of Information Technology Jurnal Teknoinfo
Claim Missing Document
Check
Articles

An Entropy-Assisted COBRA Framework to Support Complex Bounded Rationality in Employee Recruitment Raditya Rimbawan Oprasto; Junhai Wang; A Ferico Octaviansyah Pasaribu; Setiawansyah Setiawansyah; Riska Aryanti; Sumanto Sumanto
Bulletin of Computer Science Research Vol. 5 No. 3 (2025): April 2025
Publisher : Forum Kerjasama Pendidikan Tinggi (FKPT)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47065/bulletincsr.v5i3.505

Abstract

In the employee recruitment process, decision-making often involves many criteria and relies on the subjective judgment of the decision-maker. The main problem lies in how to develop a decision support system that can overcome this complexity while maintaining rationality and objectivity. This study aims to apply a hybrid framework based on the entropy and COBRA methods to support objective decision-making in the employee recruitment process, and to overcome the limitations of subjectivity and bounded rationality in candidate selection with a structured data-driven approach. The entropy method is used to objectively determine the weight of criteria based on data variations, thereby helping to reduce subjectivity in decision-making and increase the rationality of COBRA analysis results. The results of the final calculation using the Entropy-COBRA method, were ranked nine candidates based on their final scores which reflected relative proximity to the ideal solution in the recruitment process. The candidate with the lowest score is considered to be the closest to the ideal solution and has the best overall performance. Raka employees ranked first with a final score of -0.0618, followed by Andra in second place with a score of -0.0597, and Fajar in third place with -0.0357. The results of the final score in the COBRA method with a lower score indicate that an alternative shows superior performance over the other. This framework makes a real contribution to data-driven decision-making for human resource management, particularly in the context of recruitment involving multiple criteria and alternatives.
Analisis Sentimen Pengguna GoPay pada Layanan Keuangan Digital dengan Perbandingan Naïve Bayes dan SVM Dian Ardiansyah; Riska Aryanti; Eka Fitriani; Royadi
PROFITABILITAS Vol 5 No 2 (2025): JURNAL PROFITABILITAS
Publisher : Sistem Informasi Akuntansi Kampu Kabupaten Karawang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.31294/profitabilitas.v5i2.11513

Abstract

The rapid development of digital financial services has led to increased use of digital wallets, one of which is the GoPay application, resulting in a large volume of user reviews. These reviews contain valuable information regarding user satisfaction and service-related issues, making automated methods necessary to accurately analyze user sentiment. This study aims to analyze sentiment in GoPay user reviews and compare the performance of the Naïve Bayes and Support Vector Machine (SVM) algorithms for sentiment classification.This research uses a dataset of 132,393 GoPay user reviews obtained from the Kaggle platform. The data are labeled based on user ratings into three sentiment classes: positive, neutral, and negative. The research stages include text preprocessing, feature transformation using the Term Frequency–Inverse Document Frequency (TF-IDF) method, sentiment classification using the Naïve Bayes and SVM algorithms, and model performance evaluation using accuracy, precision, recall, and F1-score metrics.The results show that 79.2% of the reviews are classified as positive, 17.1% as negative, and 3.7% as neutral. Based on performance evaluation, the SVM algorithm demonstrates superior results with an accuracy of 90.65%, precision of 90.7%, recall of 90.65%, and F1-score of 89.05%, compared to Naïve Bayes, which achieves an accuracy of 87.89%, precision of 89.1%, recall of 87.89%, and F1-score of 88.42%. These findings indicate that SVM is a more optimal method for sentiment analysis of GoPay user reviews, while Naïve Bayes remains an efficient and competitive alternative for large-scale text classification.
Optimization of Crop Recommendation Model Using Ensemble Learning Techniques for Multiclass Classification Siti Marlina; Titik Misriati; Riska Aryanti
Computer Science (CO-SCIENCE) Vol. 6 No. 1 (2026): January 2026
Publisher : LPPM Universitas Bina Sarana Informatika

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.31294/co-science.v6i1.10044

Abstract

Crop recommendation systems play a crucial role in modern agriculture by helping farmers make data-driven decisions to maximize yield, optimize resource use, and ensure sustainable farming practices. By analyzing environmental and soil parameters, these systems can suggest the most suitable crops for specific conditions, reducing the risks of crop failure and improving overall productivity. This study evaluates the performance of five ensemble learning algorithms—Random Forest, Extra Trees, CatBoost, XGBoost, and LightGBM—for multiclass classification in a crop recommendation system. All models achieved high accuracy above 98%, with Random Forest demonstrating the best and most stable performance. The feature importance analysis revealed that climatic factors, particularly rainfall and humidity, contributed the most to prediction outcomes, followed by macronutrients such as potassium, phosphorus, and nitrogen. In contrast, temperature and soil pH showed relatively lower influence. These findings highlight the dominance of climatic factors over soil chemical properties and demonstrate the capability of ensemble learning methods to capture complex data patterns. Random Forest is recommended as the primary model to support more effective land management and crop cultivation strategies.
Soft Voting Based Optimized Ensemble for Migraine Type Classification Titik Misriati; Riska Aryanti; Henny Leidiyana
Jurnal Informatika dan Rekayasa Perangkat Lunak Vol. 6 No. 3 (2025): Volume 6 Number 3 September 2025
Publisher : Universitas Teknokrat Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33365/jatika.v6i3.861

Abstract

The accurate classification of migraine subtypes is a complex challenge in neurology, hindered by symptomatic similarities between types. This complexity necessitates advanced computational tools to support diagnostic precision. This study aims to develop and evaluate an optimized soft voting ensemble classifier to automate this multi-class classification task effectively. The methodology involved training eight base models—including Neural Network, Random Forest, and Gradient Boosting—on a publicly available migraine dataset, with an 80-20 train-test split. The top three performers were integrated into a soft voting ensemble, which aggregates their predicted probabilities to enhance decision robustness. Model performance was rigorously assessed using accuracy, precision, recall, F1-score, and AUC-ROC metrics. The results demonstrated that the proposed ensemble achieved superior performance, with an accuracy of 91.67% and an F1-score of 91.50%, outperforming all constituent models. Furthermore, the ensemble attained near-perfect AUC-ROC values across multiple classes, confirming its strong discriminatory capability. The study concludes that the soft voting ensemble is a highly effective and reliable approach for migraine subtype classification, offering significant potential as a decision-support tool in clinical environments. Future work will focus on hyperparameter optimization, explainability, and validation with larger multi-centric datasets to facilitate clinical adoption.
Comprehensive Evaluation of Distance-Based MCDM Methods Using Response to Criteria Weighting: A Ranking Stability and Sensitivity Analysis Sumanto Sumanto; Ryan Randy Suryono; Riska Aryanti; Hetty Rohayani; Setiawansyah Setiawansyah; Desyanti Desyanti
Journal of Information Technology, Software Engineering and Computer Science (ITSECS) Vol. 4 No. 4 (2026): Volume 4 Number 4 October 2026
Publisher : PT. Tech Cart Press

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.58602/itsecs.v4i4.377

Abstract

Selecting an appropriate new store location is a complex multi-criteria decision-making problem because potential locations must be evaluated using multiple criteria with different performance characteristics. This study proposes an integrated distance-based Multi-Criteria Decision-Making framework using RECA Weighting combined with TOPSIS, SPOTIS, and EDAS to determine objective criterion importance and evaluate the stability and robustness of alternative rankings. The dataset consists of eight potential store locations evaluated using six criteria: Rental Cost, Building Area, Accessibility, Consumer Traffic, Parking Availability, and Infrastructure. RECA Weighting is applied to determine objective criterion weights based on performance variation, while TOPSIS, SPOTIS, and EDAS are used to generate preference scores and rankings through different distance-based evaluation mechanisms. The results show that Consumer Traffic obtains the highest criterion weight of 0.1824, while Parking Availability receives the lowest weight of 0.1422. The ranking results identify LS5 as the best-performing alternative, followed by LS3, although several alternatives exhibit different ranking positions across the applied methods. Weight-variation analysis using Spearman rank correlation shows that SPOTIS achieves perfect ranking stability with a correlation of 1.0000, TOPSIS demonstrates very strong stability with a correlation of 0.9286, while EDAS produces a lower correlation of 0.1429, indicating greater ranking variation. These findings demonstrate that SPOTIS provides the highest robustness to criterion weight changes, followed by TOPSIS, whereas EDAS is more sensitive to weight variations due to its average-solution-based evaluation mechanism. Overall, the proposed framework provides a comprehensive approach for objective weighting, ranking stability assessment, sensitivity analysis, and robustness evaluation in new store location selection.
Modified Simple Additive Weighting with Ideal Distance Compensation for Improved Ranking Stability Riska Aryanti; Junhai Wang; Setiawansyah Setiawansyah; Ayuni Asistyasari; Yosep Nuryaman; Pritasari Palupiningsih
IJID (International Journal on Informatics for Development) Vol. 15 No. 2 (2026): Online First
Publisher : Faculty of Science and Technology, Universitas Islam Negeri (UIN) Sunan Kalijaga Yogyakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.14421/ijid.2026.6130

Abstract

The Simple Additive Weighting (SAW) method is a widely recognized and straightforward approach for multi-criteria decision-making. Yet it is prone to ranking instability due to its sensitivity to weight variations, normalization scales, and extreme values. To overcome these challenges, this study introduces a Modified SAW method with Ideal Distance Compensation (SAW-I), which integrates a distance-based adjustment relative to positive and negative ideal solutions within the traditional weighted summation framework. This enhancement considers not only total scores but also the relative position of each alternative in the decision space. The method was applied to two case studies. When compared to other MCDM techniques—SMART, MOORA, GRA, MAUT, WP, and WASPAS-SAW-I demonstrated very high Spearman rank correlations, approaching 1, confirming strong consistency and reliability. Sensitivity analyses further indicated that SAW-I maintains stable rankings even under variations in weights, highlighting its robustness, adaptability, and effectiveness. The sensitivity analysis shows highly stable performance, demonstrating perfect correlation (1.0000) with SMART and WP, and very strong correlation (0.9762) with MOORA, GRA, MAUT, and WASPAS. These results confirm that SAW-I provides high compatibility and consistent rankings, making it more reliable and robust.
Co-Authors Agus Junaidi Agustiani, Sarifah Aldian Mauluda Alif Rizqi Mulyawan Andi Saryoko Andika Bayu Hasta Yanto Andreas Roy Prasetya Ari Sulistiyawati Arifin, Yosep Tajul Arman Ramadhani Asistyasari, Ayuni Asriyani Sagiyanto ASRIYANI SAGIYANTO, ASRIYANI Atang Saepudin Atang Saepudin Atang Saepudin Azis, Munawar Abdul Bayu Kusuma Ilyasa Universitas Bina Sarana Informatika Dahlia Dahlia Darma Setiawan Putra Dede Firmansyah Dede Firmansyah Saefudin Dedi Darwis Deni Gunawan Desyanti Desyanti Diah Puspitasari Dian Ardiansyah Dian Ardiansyah Dyah Ayu Megawaty Eka Dyah Setyaningsih Eka Fitriani Eka Fitriani Eka Fitriani Eka Fitriyani Elah Nurlelah Fachri, Muhamad Farah Diba Azkia Faruk Ulum Faruk Ulum Fuad Nur Hasan Haliza Ramadhanti, Pristya Harefa, Kristine Haryani Hasan, Fuad Nur Henny Leidiyana Herdian Pratama Hetty Rohayani I Gede Iwan Sudipa Irfan Ridwan Jananto Watori Junhai Wang Junhai Wang Junhai Wang Junhai Wang Kamil, Anton Abdul Basah KOMALASARI, YULI Kristine Harefa Martenia, Rina Masngud Megawaty, Dyah Ayu Mesran, Mesran Mochamad Wahyudi Munawar Abdul Azis Oktaviyani Oktaviyani Palupiningsih, Pritasari Pasaribu, A. Ferico Octaviansyah Perani Rosyani Pristya Haliza Ramadhanti Pristya Haliza Ramadhanti Rachilsyah Ramdhani Efendi Raditya Rimbawan Oprasto Rahmat Hidayat Ramadhani, Arya Richardus Eko Indrajit Rifky Permana Rifqi Rizaldi Rina Martenia Rizqi Nur Esmeralda Rosiun Universitas Bina Sarana Informatika Roy Prasetya, Andreas Royadi - Royadi Royadi Royadi, Royadi Ryan Randy Suryono Salman Alfarizi SALMAN ALFARIZI Samudi Sari Dewi Universitas Bina Sarana Informatika PSDKU Pontianak Setiawansyah Setiawansyah Siti Khotimatul Wildah Siti Marlina Siti Marlina, Siti Sopiyan Dalis Sumanto Sumanto Titik Misriati tri wahyuni Tri Wahyuni Tri Wahyuni Ulum, Faruk Wahyudi, Agung Deni Walim Walim Wang, Junhai Yarimani Laia Yosep Nuryaman