Pengelompokan Untuk Penjualan Obat Dengan Menggunakan Algoritma K-Means

Abstract

Drug grouping is an arrangement that adjusts to the flow of placement or drug layout is more suitable for standard processes. Utilization of existing data through the clustering method approach can be applied to analyze in grouping drug data on data availability and inventory in warehouses so as to provide knowledge and information. The clustering method is processed using the K-Means algorithm where the results also show a new knowledge, namely the grouping of drug data based on 2 clusters. Cluster 1 is a high need category with availability of 71 out of 100 availability categories based on the amount of drug data tested, then cluster 2 is a drug category with moderate or low availability, namely 29 out of 100 availability categories based on the number of drug data tested. Tests using Rapid Miner tools can also produce similar insights, namely each cluster has cluster group members according to manual calculations such as Cluster_0 in Rapid Miner has 72 cluster members representing the Medium cluster, Cluster_1 has 72 cluster group members as high cluster representations, and Cluster_2 has 3 cluster members corresponding to low representation.