scholarly journals ANALISIS PEMILIHAN CLUSTER OPTIMAL DALAM SEGMENTASI PELANGGAN TOKO RETAIL

2021 ◽  
Vol 18 (2) ◽  
pp. 152
Author(s):  
Santi Ika Murpratiwi ◽  
I Gusti Agung Indrawan ◽  
Arik Aranta
Keyword(s):  
Data Mining ◽  
Loyal Customers

Saat ini pemanfaatan data menjadi fokus dalam bidang pemasaran khususnya untuk menyusun strategi. Agar strategi pemasaran bisa tepat sasaran dibutuhkan segmentasi pelanggan. Data mining khususnya clustering mampu membantu proses segmentasi pelanggan. Dalam penelitian ini, data mining diimplementasikan untuk segmentasi pelanggan UD. XYZ dengan metode K-Means, K-medoids, dan Means.. Tujuan penelitian ini adalah mencari metode dan nilai k terbaik yang dihasilkan dari tiga metode clustering. Penelitian ini menyajikan proses Data Mining dengan menggabungkan model RFM dengan algoritma clustering K-Medoids, X-Means, dan K-Means. Dataset yang telah diimplementasikan ke dalam model RFM digunakan sebagai bahan pengolahan data. Data transaksi dengan jumlah 153.492 diimplementasikan ke dalam model RFM menjadi 10.145 data untuk dilakukan identifikasi pelanggan potensial. Inisialisasi cluster awal pada metode K-Medoids, X-Means, dan K-Means dilakukan secara random. Nilai k dalam penelitian ini diinisialisasi dari 1 sampai 10. Nilai k diimplementasikan secara berulang dan dihitung validasi cluster menggunakan metode David Bouldin Index (DBI) dan jaraj rata-rata cluster dengan centroid. Hasil penelitian menunjukkan K-medoids memiliki nilai validitas yang lebih baik dibandingkan dengan X-Means dan K-Means. Rata-rata nilai DBI yang dihasilkan metode K-Medoids adalah 0,540778. Jumlah cluster terbaik yang dihasilkan adalah 5 cluster, hal ini ditentukan dengan mempertimbangkan jumlah persebaran data pada k = 5 yang menghasilkan nilai sama pada metode K-Medoids, X-Means, dan K-Means. Tingkatan pelanggan yang terbentuk adalah About To Sleep, Customer Needing Attention, Recent Customer, Potential Loyalist, dan Loyal Customers.

Solving customer insurance coverage sales plan problem using a multi-stage data mining approach

Kybernetes ◽  
2018 ◽  
Vol 47 (1) ◽  
pp. 2-19 ◽  
Author(s):  
Farshid Abdi ◽  
Kaveh Khalili-Damghani ◽  
Shaghayegh Abolmakarem
Keyword(s):  
Data Mining ◽  
Insurance Coverage ◽  
High Potential ◽  
Insurance Companies ◽  
Feature Subset ◽  
Insurance Company ◽  
Contract Term ◽  
Content Type ◽  
Data Mining Approach ◽  
Loyal Customers

Purpose Customer insurance coverage sales plan problem, in which the loyal customers are recognized and offered some special plans, is an essential problem facing insurance companies. On the other hand, the loyal customers who have enough potential to renew their insurance contracts at the end of the contract term should be persuaded to repurchase or renew their contracts. The aim of this paper is to propose a three-stage data-mining approach to recognize high-potential loyal insurance customers and to predict/plan special insurance coverage sales. Design/methodology/approach The first stage addresses data cleansing. In the second stage, several filter and wrapper methods are implemented to select proper features. In the third stage, K-nearest neighbor algorithm is used to cluster the customers. The approach aims to select a compact feature subset with the maximal prediction capability. The proposed approach can detect the customers who are more likely to buy a specific insurance coverage at the end of a contract term. Findings The proposed approach has been applied in a real case study of insurance company in Iran. On the basis of the findings, the proposed approach is capable of recognizing the customer clusters and planning a suitable insurance coverage sales plans for loyal customers with proper accuracy level. Therefore, the proposed approach can be useful for the insurance company which helps them to identify their potential clients. Consequently, insurance managers can consider appropriate marketing tactics and appropriate resource allocation of the insurance company to their high-potential loyal customers and prevent switching them to competitors. Originality/value Despite the importance of recognizing high-potential loyal insurance customers, little study has been done in this area. In this paper, data-mining techniques were developed for the prediction of special insurance coverage sales on the basis of customers’ characteristics. The method allows the insurance company to prioritize their customers and focus their attention on high-potential loyal customers. Using the outputs of the proposed approach, the insurance companies can offer the most productive/economic insurance coverage contracts to their customers. The approach proposed by this study be customized and may be used in other service companies.

Data Mining and Machine Learning

2020 ◽  
Author(s):  
Mohammed J. Zaki ◽  
Wagner Meira, Jr
Keyword(s):  
Machine Learning ◽  
Data Mining

Heart Rate Variability, Emotions, and Music

2010 ◽  
Vol 24 (2) ◽  
pp. 112-119 ◽  
Author(s):  
F. Riganello ◽  
A. Candelieri ◽  
M. Quintieri ◽  
G. Dolce
Keyword(s):  
Data Mining ◽  
Heart Rate ◽  
Heart Rate Variability ◽  
Vegetative State ◽  
Low Frequency ◽  
Emotional Reactions ◽  
Heart Beat ◽  
Healthy Controls ◽  
Frequency Spectra ◽  
Emotional Value

The purpose of the study was to identify significant changes in heart rate variability (an emerging descriptor of emotional conditions; HRV) concomitant to complex auditory stimuli with emotional value (music). In healthy controls, traumatic brain injured (TBI) patients, and subjects in the vegetative state (VS) the heart beat was continuously recorded while the subjects were passively listening to each of four music samples of different authorship. The heart rate (parametric and nonparametric) frequency spectra were computed and the spectra descriptors were processed by data-mining procedures. Data-mining sorted the nu_lf (normalized parameter unit of the spectrum low frequency range) as the significant descriptor by which the healthy controls, TBI patients, and VS subjects’ HRV responses to music could be clustered in classes matching those defined by the controls and TBI patients’ subjective reports. These findings promote the potential for HRV to reflect complex emotional stimuli and suggest that residual emotional reactions continue to occur in VS. HRV descriptors and data-mining appear applicable in brain function research in the absence of consciousness.

Challenges and Cloud Computing Environments Towards Big Data

2014 ◽  
pp. 203-208
Author(s):  
Kiran Kumar S V N Madupu
Keyword(s):  
Data Mining ◽  
Cloud Computing ◽  
Big Data ◽  
Technology Development ◽  
Computing Environments ◽  
Modern Technologies

Big Data has terrific influence on scientific discoveries and also value development. This paper presents approaches in data mining and modern technologies in Big Data. Difficulties of data mining as well as data mining with big data are discussed. Some technology development of data mining as well as data mining with big data are additionally presented.

Penerapan Data Mining Untuk Prediksi Penjualan Mobil Menggunakan Metode K-Means Clustering

2020 ◽  
Vol 3 (3) ◽  
pp. 187-201
Author(s):  
Sufajar Butsianto ◽  
Nindi Tya Mayangwulan
Keyword(s):  
Data Mining ◽  
Clustering Data ◽  
Cluster 2

Penggunaan mobil di Indonesia setiap tahunnya selalu meningkat dan membuat perusahaan otomotif berlomba-lomba dalam peningkatan penjualannya. Tujuan dari penelitian ini untuk mengelompokan data penjualan kedalam sebuah cluster dengan metode Data Mining Algoritma K-Means Clustering. Data Penjualan nantinya akan dikelompokan berdasarkan kemiripan data tersebut sehingga data dengan karakteristik yang sama akan berada dalam satu cluster. Atribut yang digunakan adalah brand dan penjualan. Cluster yang terbentuk setelah dilakukan proses K-Means Clustering terbagi menjadi tiga cluster yaitu Cluster 0 jumlah anggota 235 dengan presentase 26% dikategorikan Laris, Cluster 1 jumlah anggota 604 dengan presentase 67% dikategorikan Kurang Laris, dan Cluster 2 jumlah angota 61 dengan presentase 7% dikategorikan Paling Laris, dari proses clustering diatas dapat diperoleh validasi DBI (Davies Bouldin Index) dengan nilai 0,341

Sign in / Sign up

Export Citation Format

Share Document