Implementasi Algoritma K-Means Guna Pengelompokkan Data Penjualan Berdasarkan Pembelian

Abstract

Information technology can help solve problems faced by humans by facilitating performance. Information technology and information systems are difficult to separate in the business world. Data mining is the core of the KDD process, which involves inferring algorithms that explore data, developing models and finding previously unknown patterns. KDD is often referred to as knowledge discovery in databases. The KDD process generally consists of 5 stages, namely data selection, pre-processing/cleaning, transformation, data mining and interpretation/evaluation. K-Means is a clustering algorithm in data mining to be able to produce groups of large amounts of data with a point-based partition method with fast and efficient computing time. Clustering is the process of dividing objects from a data set into several homogeneous clusters. The main purpose of the cluster method is to group a number of data/objects into clusters (groups) so that each cluster will contain data that is as similar as possible. This study aims to provide real solutions to UD. Martua in order to know which items are selling well and which items are not selling well so that the object can know which items need to be added to the stock and which items need to be reduced. The method used in this study is the K-Means method with stages, namely data selection, pre-processing, data transformation, information extraction and evaluation of results. The data consists of 30 item data, there are 8 as members of C1 and are best-selling items and 22 as members of C2 and are not selling items. The conclusion that can be obtained from this study is that the K-Means method can group items at UD. Martua. This study shows that the implementation of the K-Means method with the support of the RapidMiner application is effective in grouping item data at UD. Martua.