Application of Improved K-Means Clustering Algorithm in Customer Segmentation

Gang Li

doi:10.4028/www.scientific.net/AMM.411-414.1081

Paper Titles

Data Integrity and Availability in Cloud Computing Based on Megastore
p.1062

Rolling Bearing Fault Feature Extraction Based on SVD-EEMD
p.1067

Analysis of Aprior Algorithm in Mining Association Rules
p.1072

An Optimized Pruning-Based Outlier Detecting Algorithm
p.1076

Application of Improved K-Means Clustering Algorithm in Customer Segmentation
p.1081

Design of EWMA Control Charts for Controlling Dependent Process Stages with Attribute Data
p.1085

Efficient Monte Carlo Simulation for Pricing Variance Derivatives under Multi-Factor Stochastic Volatility Models
p.1089

A Novel Trend Relational Algorithm Based on Fuzzy Clustering Method
p.1095

Analysis and Study of the Process Enterprise Knowledge Management Model Based on the Recommendation Algorithm
p.1099

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 411-414Application of Improved K-Means Clustering...

Application of Improved K-Means Clustering Algorithm in Customer Segmentation

Abstract:

Market competition is the competition for customers. By adopting customer segmentation model, decision makers can effectively identify valuable customers and then develop effective marketing strategy. Cluster analysis is one of the major data analysis methods and the k-means clustering algorithm is widely used. But the original k-means algorithm is computationally expensive and the quality of the resulting clusters heavily depends on the selection of initial centroids. An improved K-means algorithm is presented,with which K value of clustering number is located according to the clustering objects distribution density of regional space,and it uses centroids of high-density region as initial clustering center points. The proposed method makes the algorithm more effective and efficient, so as to gets better clustering with reduced complexity.