Article Per Year (5 Year)
p-Index From 2021 - 2026
1.006
P-Index
This Author published in this journals
All Journal Sebatik IJISTECH (International Journal Of Information System & Technology) Building of Informatics, Technology and Science IJISTECH Bulletin of Information Technology (BIT) Jurnal Teknik Informatika
Ekawati, Hanifah
Unknown Affiliation
Computer Science & IT Decision Sciences, Operations Research & Management Electrical & Electronics Engineering Engineering Social Sciences

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

Found 2 Documents
Search
Journal : Building of Informatics, Technology and Science

 1 
Perbandingan Kinerja Algoritma K-Nearest Neighbor dan Algoritma Random Forest Untuk Klasifikasi Data Mining Pada Penyakit Gagal Ginjal Salmon, Salmon; Azahari, Azahari; Ekawati, Hanifah
Building of Informatics, Technology and Science (BITS) Vol 6 No 3 (2024): December 2024
Publisher : Forum Kerjasama Pendidikan Tinggi

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

Abstract

Kidney failure is one of the most common chronic diseases worldwide. This condition occurs when the kidneys lose their ability to filter waste and excess fluid from the blood. Kidney failure is a serious condition that occurs when kidney function decreases significantly or stops altogether. Kidney failure has a wide impact on the physical, mental, and social health of patients. Therefore, early treatment and a holistic approach are needed to minimize its impact. In the health sector, technological advances have enabled more effective processing of medical data through the application of data mining. Data Mining is the process of exploring and analyzing large amounts of data to find patterns, relationships, or valuable information that was previously unknown. Classification in Data Mining is the process of grouping or categorizing data into certain classes or labels based on the attributes or features it has. In the classification itself, there are various algorithms in it such as the K-Nearest Neighbor (KNN) and Random Forest (RF) algorithms. The K-Nearest Neighbor (KNN) and Random Forest (RF) algorithms are two algorithms that are widely used in classification tasks. Therefore, this study will carry out a comparison process on the performance of the K-Nearest Neighbor algorithm and the Random Forest algorithm. Comparison of data mining algorithm performance to evaluate and determine which algorithm is the most effective and efficient in solving a particular problem based on various evaluation metrics. Overall, the accuracy value obtained is above 90%, but the Random Forest algorithm has better performance. Where the accuracy level results obtained from the Random Forest algorithm are 99.75%. Therefore, the model or pattern produced by the Random Forest algorithm will later be used to assist in the process of diagnosing kidney failure and the Random Forest algorithm is an algorithm that has better performance.
Clustering the Economic Conditions of Various Countries From 2010-2023 by Conducting A Comparative Analysis of the K-Means and K-Medoids Algorithms Yunita, Yunita; Ekawati, Hanifah; Yusnita, Amelia
Building of Informatics, Technology and Science (BITS) Vol 7 No 1 (2025): June (2025)
Publisher : Forum Kerjasama Pendidikan Tinggi

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

Abstract

Understanding the similarities and differences in economic conditions across countries is crucial for various stakeholders. This research investigates the global economic landscape by clustering countries based on their economic indicators, including GDP, inflation rate, unemployment rate, and economic growth, spanning the period of 2010 to 2023. This timeframe encompasses significant global economic events, making it pertinent for analysis. The study employs and compares two prominent clustering algorithms: K-Means and K-Medoids, to identify groups of countries exhibiting similar economic patterns. Utilizing secondary data from Kaggle encompassing 19 countries, the research assesses the ability of each algorithm to delineate meaningful economic clusters. The K-Means algorithm, with a determined optimal number of four clusters, demonstrated a reasonably good cluster separation and moderate internal cohesion, evidenced by a Silhouette Coefficient of 0.58 and a Davies-Bouldin Index of 0.63. In contrast, the K-Medoids algorithm yielded a distinct clustering structure with a lower Silhouette Coefficient (0.26) and a higher Davies-Bouldin Index (1.16), suggesting less distinct cluster separation and potential sensitivity to data characteristics. This comparative analysis provides insights into the applicability and performance of K-Means and K-Medoids in discerning global economic structures, contributing to a deeper understanding of the world economic map and the utility of clustering techniques in economic data analysis.
Co-Authors Amelia Yusnita Azahari, Azahari Cembes, Yosefina Harianto, Kusno Hendri Setiawan M. Irwan Ukkas Irwan Ukkas Ukkas Muhammad Ibnu Saad Saad Pratiwi, Heny Riandi, Tendi Salmon Salmon, Salmon Yunita Yunita