Baraku, Randi
Unknown Affiliation

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

Found 2 Documents
Search

Analysis of Elbow, Silhouette, Davies-Bouldin, Calinski-Harabasz, and Rand-Index Evaluation on K-Means Algorithm for Classifying Flood-Affected Areas in Jakarta Ashari, Ilham Firman; Dwi Nugroho, Eko; Baraku, Randi; Novri Yanda, Ilham; Liwardana, Ridho
Journal of Applied Informatics and Computing Vol. 7 No. 1 (2023): July 2023
Publisher : Politeknik Negeri Batam

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

Abstract

Jakarta is the capital city of Indonesia, which has a high population density, and is an area that is frequently hit by floods. This study aims to determine the classification of flood-affected areas in Jakarta between severe, moderate, and low. Design/method/approach: The study was conducted using the elbow, Silhouette, Davidson-Bouldin, and Calinski-Harabasz methods on the K-means algorithm, as well as the Rand method. index for evaluation. Grouping with 3 and 6 groups is the best grouping value based on Calinski-Harabasz. By using the davies bouldin index from the observations, the K value with a value of 6 has the smallest Davies-Bouldin value with a value of 0.2737. By using sillhoute, the experimental results obtained the best values sequentially, namely K=2, K=3, and K=6 with silhouette values of 0.866, 0.854, and 0.803. In this experiment, based on the elbow method, it was found that the best K value was K=3. This was obtained because it was based on observations on the appearance of the SSE data compared to the value of K. In the graph above, it can be seen that the largest decrease in data occurred at K=3 and after this decrease, the decline began to slope. The rand index is a method used to compare several cluster methods. If the value is >= 90 it is a very good result, if the value is in the range 80 to 90 it identifies a good index, whereas if it is below 80 it indicates a bad index. The results show that cluster three is verified as the best cluster with a value of 1, followed by a second alternative with cluster 2 of 0.9182. From several validation and evaluation methods it can be concluded that the best grouping can be done using 3 clusters. The results of the study yielded a value of 75.4% in low areas, 21.1% in moderate areas, and 3.5% in severe areas.
Analysis and Implementation of Blowfish and LSB Algorithm on RGB Images using SHA-512 Ashari, Ilham Firman; Praseptiawan, Mugi; Baraku, Randi; Filiana, Edinia Rosa
Computer Engineering and Applications Journal (ComEngApp) Vol. 13 No. 1 (2024)
Publisher : Universitas Sriwijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

The growth of the internet globally keeps increasing as time goes. There's a big amount of data type saved there too. Those data need to be secured so anyone who doesn't have the right to access them can access it. The purpose of this article is to secure text information into image media using the Blowfish method for encrypting text information and securing it using the Hash function SHA-512 and then embedded it in image media using the Least Significant Bit (LSB) method. The result of implementing those methods using image media sized 138Kb and 39.85Kb with plaintext measuring 27 and 85 characters shows that integrity data is secured with SHA-512 method. The test result using PSNR method to get the score of image quality after embedding information to the image shows that the average number of PSNR’s score is 70,74 dB which means the quality is good and has less difference from the original image.