cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
Hindayati Mustafidah
Contact Email
jurnal.juita@gmail.com
Phone
+6285842817313
Journal Mail Official
jurnal.juita@gmail.com
Editorial Address
Gedung Fakultas Teknik dan Sains Universitas Muhammadiyah Purwokerto Jl. K.H. Ahmad Dahlan, Dukuh Waluh, Kembaran, Banyumas, Central Java, Indonesia
Location
Kab. banyumas,
Jawa tengah
INDONESIA
JUITA : Jurnal Informatika
Published by Universitas Muhammadiyah Purwokerto
ISSN : 20869398     EISSN : 25798901     DOI : 10.30595/JUITA
Core Subject : Science,
Computer Science & IT
UITA: Jurnal Informatika is a science journal and informatics field application that presents articles on thoughts and research of the latest developments. JUITA is a journal peer reviewed and open access. JUITA is published by the Informatics Engineering Study Program, Universitas Muhammadiyah Purwokerto. JUITA invites researchers, lecturers, and practitioners worldwide to exchange and advance knowledge in the field of Informatics. Documents submitted must be in Ms format. Word and written according to author guideline. JUITA is published twice a year in May and November. Currently, JUITA has been indexed by Google Scholar, IPI, DOAJ, and has been accredited by SINTA rank 2 through the Decree of the Director-General of Research and Development Strengthening of the Ministry of Research, Technology and Higher Education No. 36/E/KPT/2019. JUITA is intended as a media for informatics research among academics, practitioners, and society in general. JUITA covers the following topics of informatics research: Software engineering Artificial Intelligence Data Mining Computer network Multimedia Management Information System Digital forensics Game
Arjuna Subject : Ilmu Komputer (semua kategori) - Ilmu Komputer (Lain-Lain)
Articles 7 Documents
 1 
Search results for , issue "JUITA Vol. 12 No. 2, November 2024" : 7 Documents clear
Implementation of PPCA Imputation, SMOTE-N Class Balancing in Hepatitis Classification Using Naïve Bayes Fathmah, Siti; Kartini, Dwi; Abadi, Friska; Budiman, Irwan; Mazdadi, Muhammad Itqan
JUITA: Jurnal Informatika JUITA Vol. 12 No. 2, November 2024
Publisher : Department of Informatics Engineering, Universitas Muhammadiyah Purwokerto

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30595/juita.v12i2.21528

Abstract

The availability of complete data in research is crucial, especially in the initial stages. The Hepatitis data used in this study encountered issues such as missing data and class imbalance, which hindered its optimal utilization. The method employed to address missing data was the PPCA imputation method. After filling in the missing data, the data was balanced using the SMOTE-N class balancing method and classified using Gaussian Naïve Bayes. The aim of this research was to compare the classification evaluation of hepatitis disease using Naive Bayes with the PPCA imputation approach and SMOTE-N class balancing. The best results from each scenario yielded an AUC value of 0.833 in the first scenario with an 80:20 data split for training and testing, and 0.875 in the second scenario with a 90:10 data split. The highest AUC value was obtained in the application of PPCA imputation with SMOTE-N class balancing using Naive Bayes classification. This demonstrates that the implementation of PPCA imputation with SMOTE-N class balancing has a better impact on the performance of Naïve Bayes classification.
ScreenMy: a Lightweight Architecture of Tuberculosis-Diabetes Mellitus Screening System Integrating with EMRs Suryanto, Farid; Arini, Merita; Riadi, Imam
JUITA: Jurnal Informatika JUITA Vol. 12 No. 2, November 2024
Publisher : Department of Informatics Engineering, Universitas Muhammadiyah Purwokerto

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30595/juita.v12i2.21541

Abstract

Background: Early detection of diseases like tuberculosis (TB) and diabetes mellitus (DM) is critical for preventive healthcare. However, integrating effective screening programs within existing workflows can be challenging. Objective: This study explores the feasibility and impact of integrating an electronic screening system (ESS) within electronic medical records (EMRs) in private primary care settings. The pilot study focuses on ScreenMy, an ESS engine designed for bi-directional TB-DM screening. Methods: A pilot study investigated the integration process of ScreenMy into an EMR system. Interviews with developers assessed factors like installation ease, flexibility, and impact on the EMR's functionality. Findings: The findings revealed a smooth integration process due to ScreenMy's external design (requiring only plugin injection) and clear documentation.  The integration maintained EMR performance and efficiency, enhanced the developer experience, and offered flexibility for customization.  Developers, unfamiliar with prior integrated screening systems, found ScreenMy user-friendly and expressed interest in further system flexibility concerning data privacy. Conclusion: This investigation highlights the potential for seamless integration of screening systems like ScreenMy within EMRs. This paves the way for improved preventive healthcare delivery in primary care settings.
Handling Noise Data with PCA Method and Optimization Using Hybrid Fuzzy C-Means and Genetic Algorithm Widianti, Risa; Surono, Sugiyarto; Ibraheem, Kais Ismail
JUITA: Jurnal Informatika JUITA Vol. 12 No. 2, November 2024
Publisher : Department of Informatics Engineering, Universitas Muhammadiyah Purwokerto

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30595/juita.v12i2.21765

Abstract

The significance of machine learning (ML) and data mining techniques particularly clustering is examined in this research, in managing large data sets for customer segmentation in the retail sector. The research emphasizes the challenges posed by data noise and proposes a solution using Principal Component Analysis (PCA) to improve accuracy. This study introduces a hybrid approach that combines Fuzzy C-Means (FCM) with genetic algorithms for optimization in customer segmentation, and suggests further research on the optimal number of clusters and data noise elimination. By addressing data noise, the proposed PCA-based method achieved a higher accuracy rate of 98% compared to 93% without PCA. This finding underscores the effectiveness of PCA in noise reduction, improving clustering accuracy. This research contributes to the advancement of customer-focused business strategies through better data analysis and interpretation. The proposed approach has potential applications in areas including data analysis, pattern recognition, and image processing, highlighting its relevance in the contemporary business environment.
Improved SVM Classification Using Particle Swarm Optimization for Student Completion Prediction System Asana, I Made Dwi Putra; Oka, I Dewa Gede Ari; Widyantara, I Made Oka; Sandhiyasa, I Made Subrata
JUITA: Jurnal Informatika JUITA Vol. 12 No. 2, November 2024
Publisher : Department of Informatics Engineering, Universitas Muhammadiyah Purwokerto

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30595/juita.v12i2.21990

Abstract

Timely completion of a study program is crucial for evaluating the quality of universities. To achieve timely completion, student’s progress needs to be monitored early in order to ensure that they can complete the given task on time. This process is particularly important because universities often enroll thousands of students, thereby making individual supervision impractical. An effective solution to this problem is leveraging machine learning to develop a system that predicts whether student will complete the study without delay. Therefore, this study used Support Vector Machine (SVM) method for classification, with RBF kernel. Optimization of SVM classification was achieved by ensuring the values for Soft Margin C parameter and kernel parameter were correct. In addition, Particle Swarm Optimization (PSO) method was used to determine the optimal SVM parameter values. Consequently, the resulting model was evaluated using Cross Fold Validation. The optimized SVM parameter identified through PSO were gamma of 0.0085 and C of 0.4196. The average training accuracy recorded is 82.58%, with 81.22% validation, these results can be categorized into Good Classification. Finally, the application of PSO in optimization resulted in SVM models that avoided overfitting, as shown by the closeness of training and validation values.
Development of Staff Evaluation Software Based on Association Matrix Methods and Data Mining Using the Streamlit Framework Susetyo, Yosia Adi; Parhusip, Hanna Arini; Trihandaru, Suryasatriya
JUITA: Jurnal Informatika JUITA Vol. 12 No. 2, November 2024
Publisher : Department of Informatics Engineering, Universitas Muhammadiyah Purwokerto

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30595/juita.v12i2.23300

Abstract

This study discusses evaluating employee performance in microbiology laboratories using an association matrix implemented in web-based software with the Streamlit framework. The purpose of the research is to improve the employee performance evaluation process, which previously used conventional methods. This software is built from a sample receipt recording history data stored in a MySQL database. The initially unstructured data was processed using Python libraries such as NumPy, Matplotlib, Pandas, and Difflib to generate personnel evaluation information such as specialization, task duration, workload, and individual competencies. This software can provide a fast and accurate performance assessment according to the evaluation period. In a test with the System Usability Scale (SUS), the software scored 75.83, which was rated "good.". These results show that the software is easy to use and can improve the efficiency of employee performance evaluation. Follow-up tests with questionnaires given to 18 users showed that this system was preferable to previous conventional methods. This software helps laboratory managers evaluate employee performance effectively and efficiently.
Characteristics of Machine Learning-based Univariate Time Series Imputation Method Ramadhani, Dini; Soleh, Agus Mohamad; Erfiani, Erfiani
JUITA: Jurnal Informatika JUITA Vol. 12 No. 2, November 2024
Publisher : Department of Informatics Engineering, Universitas Muhammadiyah Purwokerto

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30595/juita.v12i2.23453

Abstract

Handling missing values in univariate time series analysis poses a challenge, potentially leading to inaccurate conclusions, especially with frequently occurring consecutive missing values. Machine Learning-based Univariate Time Series Imputation (MLBUI) methods, utilizing Random Forest Regression (RFR) and Support Vector Regression (SVR), aim to address this challenge. Considering factors such as time series patterns, missing data patterns, and volume, this study explores the performance of MLBUI in simulated Autoregressive Integrated Moving Average (ARIMA) datasets. Various missing data scenarios (6%, 10%, and 14%) and model scenarios (Autoregressive (AR) models: AR(1) and AR(2); Moving Average (MA) models: MA(1) and MA(2); Autoregressive Moving Average (ARMA) models: ARMA(1,1) and ARMA(2,2); and Autoregressive Integrated Moving Average (ARIMA) models: ARIMA(1,1,1) and ARIMA(1,2,1)) with different standard deviations (0.5, 1, and 2) were examined. Five comparative methods were also used in this research, including Kalman StructTS, Kalman Auto-ARIMA, Spline Interpolation, Stine Interpolation, and Moving Average. The research findings indicate that MLBUI performs exceptionally well in imputing successive missing values. The results of this study indicate that the performance of MLBUI in imputing consecutive missing values, based on MAPE, yielded values of less than 10% across all scenarios used.
Machine Learning Techniques for Heart Disease Prediction Using a Multi-Algorithm Approach Biddinika, Muhammad Kunta; Masitha, Alya; Herman, Herman; Fatimah, Vita Arfiana Nurul
JUITA: Jurnal Informatika JUITA Vol. 12 No. 2, November 2024
Publisher : Department of Informatics Engineering, Universitas Muhammadiyah Purwokerto

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30595/juita.v12i2.24153

Abstract

This analysis explores the efficiency of machine learning systems for heart disease identification through a multi-algorithm approach. The main objective is to identify the best performing algorithm for accurate disease prediction, improving clinical decision making. Using criteria including accuracy, precision, recall, F1 score, and recall, the study assessed four algorithms: Random Forest (RF), Naïve Bayes (NB), Support Vector Machine (SVM), and Decision Tree (DT). The results show that Random Forest outperforms the others, achieving 86.23% precision, 93.76% recall, 89.84% F1 score, and 88.41% accuracy. Random Forest gets an AUC ROC result of 0.94, so Random Forest is considered a superior model in this scenario, especially because it has higher accuracy. The algorithms showed a strong balance between sensitivity and specificity. Decision Tree showed reasonable performance with a precision of 84.18% and a recall of 90.27%, while Naïve Bayes recorded a precision of 87.68% and a recall of 87.03%. SVM showed a precision of 87.40% and a recall of 84.78%, indicating some limitations in capturing positive cases. The novelty of this study lies in the comparative analysis of several algorithms to optimize the heart disease prediction model for clinical use. The random forest algorithm is one of the choices, but there is still a medical standard for classifying people as either indicating or not experiencing heart failure, according to the study.

Page 1 of 1 | Total Record : 7

 1 

Filter by Year

2024 2024


Reset
Filter By Issues
All Issue JUITA Vol. 13 Issue 1, March 2025 JUITA Vol. 12 No. 2, November 2024 JUITA Vol. 12 No. 1, May 2024 JUITA Vol. 11 No. 2, November 2023 JUITA Vol. 11 No. 1, May 2023 JUITA Vol. 10 No. 2, November 2022 JUITA Vol. 10 No. 1, May 2022 JUITA Vol. 9 No. 2, November 2021 JUITA Vol. 9 No. 1, May 2021 JUITA Vol. 8 Nomor 2, November 2020 JUITA Vol. 8 Nomor 1, Mei 2020 JUITA VoL. 7 Nomor 2, November 2019 JUITA VoL. 7 Nomor 1, Mei 2019 JUITA Vol. 6 Nomor 2, November 2018 JUITA Vol. 6 Nomor 1, Mei 2018 JUITA Vol. 5 Nomor 2, November 2017 JUITA Vol. 5 Nomor 1, Mei 2017 JUITA Vol. 4 Nomor 2, November 2016 JUITA Vol. 4 Nomor 1, Mei 2016 JUITA Vol. 3, Nomor 4 Nopember 2015 JUITA Vol. 3 Nomor 3 Mei 2015 JUITA Vol. 3 Nomor 2, Nopember 2014 JUITA Vol. 3 Nomor 1, Mei 2014 JUITA Vol. 2 Nomor 4, Nopember 2013 JUITA Vol. 2 Nomor 3, Mei 2013 JUITA Vol. 2 Nomor 2, Nopember 2012 JUITA Vol. 2 Nomor 1, Mei 2012 JUITA Vol. 1 Nomor 4, Nopember 2011 JUITA Vol. 1 Nomor 3, Mei 2011 JUITA Vol. 1 Nomor 2, Nopember 2010 JUITA Vol. 1 Nomor 1, Mei 2010 More Issue