원문정보
초록
영어
During the iteration process, the traditional K-means algorithm is easily fall into local optimal solution. In order to solve this problem, this paper proposed an improved Kmeans algorithm, and used the method of maximum distance equal division to select the initial cluster centers. We preset k cluster centers, and avoid it falling into local optimal solution. Apply this improved algorithm into e-commerce customer loyalty analysis, this paper put forward a customer loyalty analysis model using the parameters of shopping recency, shopping frequency, shopping monetary, customer satisfaction and customer attention, and used the improved K-means algorithm to analyze the RFMSA customer loyalty model. The studies show that the improved K-means algorithm and RFMSA model can effectively divide the loyalty of the e-commerce customer, it also can fully reflect the customer’s current value and potential value-added ability, and provide the basis that the e-commercial enterprises can adopt different marketing strategies for different target customers.
목차
1. Introduction
2. Build RFMSA Customer Loyalty Model
3. Improved K-means Algorithm
3.1 K-means Algorithm
3.2 The Improved Selection Method of Initial Cluster Center
4. Algorithm Implementation
4.1 The Customer Loyalty Analysis of Improved K-means Algorithm
4.2 Weighted Analysis of RFMSA
4.3 The Pre-processing of Experiment Data
4.4 Clustering Result and Strategy Analysis
5. Conclusion
ACKNOWLEDGEMENTS
References
