Skripsi
PENGUJIAN ALGORITMA K-MEANS DALAM KL ASTERISASI DATA PERSEDIAAN OBAT DI KLINIK SAHABAT MANDIRI
Sahabat Mandiri Clinic has a goal, namely to improve the quality of health services for the general public. However, the current problem is that the current drug layout arrangement is not grouped by category of level of behavior in sales, but is only arranged in alphabetical order. In this case, a grouping of drug layouts will be carried out based on the category of level of sales behavior so that the clinic, especially the pharmacy department, is more effective and efficient in serving the community. The need for a supporting methodology in this case Data Mining in particular will be clustering and use the k-Means algorithm. From the drug inventory data, three tests have been carried out, namely data one year, data six months, and data three months. The results of tests that have been carried out using the k-Means algorithm show the smallest and best Davies Bouldin Index values are located at k = 5 and there is no significant difference in the results of the time periods one year, six months, and three months. Keywords: Data Mining, k-Means Algorithm, Davies Bouldin Index, Clustering
Inventory Code | Barcode | Call Number | Location | Status |
---|---|---|---|---|
2107002542 | T50971 | T509712021 | Central Library (Referens) | Available but not for loan - Not for Loan |
No other version available