Abstract

Clustering is a data mining technique used to analyse data that has variations and the number of lots. Clustering was process of grouping data into a cluster, so they contained data that is as similar as possible and different from other cluster objects. SMEs Indonesia has a variety of customers, but SMEs do not have the mapping of these customers so they did not know which customers are loyal or otherwise. Customer mapping is a grouping of customer profiling to facilitate analysis and policy of SMEs in the production of goods, especially batik sales. Researchers will use a combination of K-Means method with elbow to improve efficient and effective k-means performance in processing large amounts of data. K-Means Clustering is a localized optimization method that is sensitive to the selection of the starting position from the midpoint of the cluster. So choosing the starting position from the midpoint of a bad cluster will result in K-Means Clustering algorithm resulting in high errors and poor cluster results. The K-means algorithm has problems in determining the best number of clusters. So Elbow looks for the best number of clusters on the K-means method. Based on the results obtained from the process in determining the best number of clusters with elbow method can produce the same number of clusters K on the amount of different data. The result of determining the best number of clusters with elbow method will be the default for characteristic process based on case study. Measurement of k-means value of k-means has resulted in the best clusters based on SSE values on 500 clusters of batik visitors. The result shows the cluster has a sharp decrease is at K = 3, so K as the cut-off point as the best cluster.

Keywords

Cluster analysisData miningCluster (spacecraft)MidpointComputer sciencek-means clusteringProcess (computing)Identification (biology)Profiling (computer programming)Position (finance)MathematicsArtificial intelligenceBusiness

Affiliated Institutions

Related Publications

Strong Consistency of $K$-Means Clustering

A random sample is divided into the $k$ clusters that minimise the within cluster sum of squares. Conditions are found that ensure the almost sure convergence, as the sample siz...

1981 The Annals of Statistics 452 citations

How fast is the k-means method?

We present polynomial upper and lower bounds on the number of iterations performed by the k-means method (a.k.a. Lloyd's method) for k-means clustering. Our upper bounds are pol...

2005 Symposium on Discrete Algorithms 46 citations

Publication Info

Year
2018
Type
article
Volume
336
Pages
012017-012017
Citations
1104
Access
Closed

External Links

Social Impact

Social media, news, blog, policy document mentions

Citation Metrics

1104
OpenAlex

Cite This

Muhammad Ali Syakur, Bain Khusnul Khotimah, Eka Mala Sari Rochman et al. (2018). Integration K-Means Clustering Method and Elbow Method For Identification of The Best Customer Profile Cluster. IOP Conference Series Materials Science and Engineering , 336 , 012017-012017. https://doi.org/10.1088/1757-899x/336/1/012017

Identifiers

DOI
10.1088/1757-899x/336/1/012017