Sistem Aplikasi Berbasis Optimasi Metode Elbow Untuk Penentuan Clustering Pelanggan

Sistem Aplikasi Berbasis Optimasi Metode Elbow Untuk Penentuan Clustering Pelanggan

• By Muningsih, Elly; Kiswati, Sri;
• Jurnal Nasional Tidak Terakreditasi
• 2212
• 117-124

Customer is a very important asset for the company. Having customers who are loyal to the company is an absolute and important for the progress of the company. This study aims to help companies, especially in the online shop to create a better customer management by identifying and grouping customers into several clusters or groups to know the characteristics of their loyalty to the company. The method used in this research is K-Means method which is one of the best and most popular method in clustering algorithm. To overcome the weakness of the K-Means method in determining the number of clusters, we use the Elbow method where this method gets the comparison of the number of clusters added by calculating the SSE (Sum of Square Error) of each cluster value. This research starts from collecting the necessary data and will be processed. From total transaction data 478 then done cleaning of data and result 73 data. Then the data processed with RapidMiner software from Cluster 2 up to 10 to search the data center of each cluster. From the calculated SSE value found that the best number of clusters is 3. The end result of the research is a Visual Basic based application program that is expected to provide ease in grouping or clustering customers. Software development method using Waterfall method.

• Katakunci customer, Elbow, value Sum of Square Error, Waterfall
• URL https://jurnalteknik.unisla.ac.id/index.php/informatika/article/view/196
• Penerbit ,

REFERENSI

[1]	Agusta, Y. (2007). K-Means - Penerapan, Permasalahan dan Metode Terkait. Jurnal Sistem dan Informatika , 3, 47-60. Firmansyah. (2011). Penerapan Algoritma
[2]

Klasifikasi C4.5 Untuk Penentuan Kelayakan
Pemberian Kredit Koperasi. Jakarta: STMIK
Nusa Mandiri.

[3]	Jungermann, F. (2011). Documentation of the
Information	Extraction	Plugin	for
RapidMiner. Dortmund, Jerman: Department of Computer Science - Artificial Intelligent
Group.
[4]	Larose, D. T. (2005). Discovering Knowledge

in Data: An Introduction to Data Mining.
Hoboken, New Jersey: John Wiley & Sons,
Inc.
[5] Maimon, O., & Rokach, L. (2010). Data
Mining and Knowledge Discovery Handbook.
London: Springer Science+Business Media.
[6] Merliana., N.P.E., Ernawatii & Santoso., A.J.
(2015). Analisa Penentuan Jumlah Cluster
Terabaik pada Metode K-Means Clustering,
ISBN: 978-979-3649-81-8.
[7] Rudy, Wahyudiarti, R., Megaputri, V., &
Wihardini, R. (2008). Analisis Dan
Perancangan E-Commerce (Studi Kasus:
Roemah Soetera Batik Dan Bordir). Seminar
Nasional Informatika 2008 (semnasIF 2008)
UPN "Veteran" Yogyakarta. Yogyakarta.
[8] Setiawan, F. H. (2011). Penerapan Fuzzy CMeans Dan Apriori Untuk Rekomendasi
Promosi Produk Berdasarkan Segmentasi
Konsumen. Semarang.
[9] Suprihatin. (2011, Februari). Klatering KMeans untuk Penentuan Nilai Ujian. JUSI Vol.
I, No. I , 53-62.
[10] Susanto, S., & Suryadi, D. (2010). Pengantar
Data Mining: Menggali Pengetahuan dari

Bongkahan	Data.	Yogyakarta:	Penerbit
ANDI.
[11] Ustadiyanto,	R.	(2001).	Framework	e
Commerce. Yogyakarta: Penerbit Andi.
[12] Widiarina.,	&	Wahono,	R.S.	(2015).
Algoritma Cluster Dinamik untuk Optimasi
Cluster	pada	Algoritma	K-Means	dalam
Pemetaan Nasabah Potensial. Journal Intelligent System Vol. 1, No. 1, 32-35.	of

[13] Witten, I. H., Frank, E., & Hall, M. A. (2011).
Data mining: Practical Machine Learning
Tools and Techniques 3rd Edition. Elseiver.
[14] Xu, R., & Wunsch II, D. C. (2009).
Clustering. Kanada: IEEE Press.