Algoritma Cluster Dinamik Untuk Optimasi Cluster Pada Algoritma K-Means Dalam Pemetaan Nasabah Potensial

. Widiarina; Romi Satria Wahono

Algoritma Cluster Dinamik Untuk Optimasi Cluster Pada Algoritma K-Means Dalam Pemetaan Nasabah Potensial

. Widiarina, Romi Satria Wahono

Abstract

Pelanggan merupakan salah satu sumber keuntungan perusahaan. Pemahaman yang baik tentang pelanggan sangat penting dilakukan untuk mengetahui nilai potensial pelanggan. Saat ini pelaksanaan CRM(Customer Relationship Management) dapat membantu dalam pemahaman nilai pelanggan. Segmentasi pelanggan adalah salah satu metode yang digunakan untuk pemetaan pelanggan. Nilai potensial pelanggan dapat diukur menggunakan metode RFM (Recency,Frequency,Monetary). Algoritma K-means salah satu metode yang banyak digunakan untuk segmentasi pelanggan. K-means banyak dipakai karena algoritma nya mudah dan sederhana, tetapi algoritma ini memiliki kekurangan yaitu sensitifitas pada partisi awal jumlah cluster(k). Untuk menyelesaikan masalah sensitifitas partisi awal jumlah cluster pada algoritma K-means, maka diusulkan algoritma cluster dinamik untuk menetapkan jumlah cluster(k). Hasil percobaan menunjukan bahwa algoritma cluster dinamik pada K-means, dapat menghasilkan kualitas cluster yang lebih optimal.

Full Text:

PDF

References

Aggarwal, N., & Aggarwal, K. (2012). Comparative Analysis of k-means and Enhanced K-means clustering algorithm for data mining, International Journal of Scientific & Eninnering Research, 3(3).

Balaji, S., & Srivatsa, S. K. (2012). Customer Segmentation for Decision Support using Clustering and Association Rule based approaches, International Journal of Computer Science & Engineering Technology, 3(11), 525–529.

Chai, C., & Chan, H. (2008). Intelligent value-based customer segmentation method for campaign management : A case study of automobile retailer, Expert System with Application, 34, 2754–2762.

Chan, C. H. (2005). Online Auction Customer Segmentation Using a Neural Network Model, International Journal of Applied Science and Engineering 101–109.

Deelers, S., & Auwatanamongkol, S. (2007). Enhancing K-Means Algorithm with Initial Cluster Centers Derived from Data Partitioning along the Data Axis with the Highest Variance, World Academy of Science, Engineering and Technology, 26(December), 323–328.

M, A. S. B., & Hareesha, K. S. (2012). Dynamic Clustering of Data with Modified K-Means Algorithm, 27(Icicn), 221–225.

Maulik, U., & Bandyopadhyay, S. (2002). Performance Evaluation of Some Clustering Algorithms and Validity Indices, IEEE Transaction On Pattern Analysis And Machine Intelligence, 24(12), 1650–1654.

Prasad, P. (2011). Generating Customer Profiles for Retail Stores Using Clustering Techniques, International Journal on Computer Science and Enginnering, 3(6), 2506–2510.

Witten, I. H., Frank, E., & Hall, M. A. (2011). Data Mining: Practical Machine Learning and Tool. Burlington: Morgan Kaufmann Publisher.

Wu, Xindong & Kumar, Vipin. (2009). The Top Ten Algorithms in Data Mining. London: CRC Press.

Xing, B. I. (2010). The Evaluation of Customer Potential Value Based on Prediction and Cluster Analysis, International Conference on Management Science & Engineering 17th, Melbourne, Australia 613–618.

Yi, B., Qiao, H., Yang, F., & Xu, C. (2010). An Improved Initialization Center Algorithm for K-Means Clustering. 2010 International Conference on Computational Intelligence and Software Engineering, IEEE (1), 1–4.

Zhang, C., & Fang, Z. (2013). An Improved K-means Clustering Algorithm Traditional K-mean Algorithm, Journal of Information & Computational Science, 1, 193–199

Refbacks

There are currently no refbacks.