Precision Marketing Method of E-Commerce Platform Based on Clustering Algorithm
In user cluster analysis, users with the same or similar behavior characteristics are divided into the same group by iterative update clustering, and the core and larger user groups are detected. In this paper, we present the formulation and data mining of the correlation rules based on the clusteri...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi-Wiley
2021-01-01
|
Series: | Complexity |
Online Access: | http://dx.doi.org/10.1155/2021/5538677 |
id |
doaj-66e4ee51bcd2416794fea948d593e753 |
---|---|
record_format |
Article |
spelling |
doaj-66e4ee51bcd2416794fea948d593e7532021-03-15T00:00:24ZengHindawi-WileyComplexity1099-05262021-01-01202110.1155/2021/5538677Precision Marketing Method of E-Commerce Platform Based on Clustering AlgorithmBei Zhang0Luquan Wang1Yuanyuan Li2School of Economics and ManagementSchool of Economics and ManagementShandong Academy of GrapeIn user cluster analysis, users with the same or similar behavior characteristics are divided into the same group by iterative update clustering, and the core and larger user groups are detected. In this paper, we present the formulation and data mining of the correlation rules based on the clustering algorithm through the definition and procedure of the algorithm. In addition, based on the idea of the K-mode clustering algorithm, this paper proposes a clustering method combining related rules with multivalued discrete features (MDF). In this paper, we construct a method to calculate the similarity between users using Jaccard distance and combine correlation rules with Jaccard distances to improve the similarity between users. Next, we propose a clustering method suitable for MDF. Finally, the basic K-mode algorithm is improved by the similarity measure method combining the correlation rule with the Jaccard distance and the cluster center update method which is the ARMDKM algorithm proposed in this paper. This method solves the problem that the MDF cannot be effectively processed in the traditional model and demonstrates its theoretical correctness. This experiment verifies the correctness of the new method by clustering purity, entropy, contour, and other indicators.http://dx.doi.org/10.1155/2021/5538677 |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Bei Zhang Luquan Wang Yuanyuan Li |
spellingShingle |
Bei Zhang Luquan Wang Yuanyuan Li Precision Marketing Method of E-Commerce Platform Based on Clustering Algorithm Complexity |
author_facet |
Bei Zhang Luquan Wang Yuanyuan Li |
author_sort |
Bei Zhang |
title |
Precision Marketing Method of E-Commerce Platform Based on Clustering Algorithm |
title_short |
Precision Marketing Method of E-Commerce Platform Based on Clustering Algorithm |
title_full |
Precision Marketing Method of E-Commerce Platform Based on Clustering Algorithm |
title_fullStr |
Precision Marketing Method of E-Commerce Platform Based on Clustering Algorithm |
title_full_unstemmed |
Precision Marketing Method of E-Commerce Platform Based on Clustering Algorithm |
title_sort |
precision marketing method of e-commerce platform based on clustering algorithm |
publisher |
Hindawi-Wiley |
series |
Complexity |
issn |
1099-0526 |
publishDate |
2021-01-01 |
description |
In user cluster analysis, users with the same or similar behavior characteristics are divided into the same group by iterative update clustering, and the core and larger user groups are detected. In this paper, we present the formulation and data mining of the correlation rules based on the clustering algorithm through the definition and procedure of the algorithm. In addition, based on the idea of the K-mode clustering algorithm, this paper proposes a clustering method combining related rules with multivalued discrete features (MDF). In this paper, we construct a method to calculate the similarity between users using Jaccard distance and combine correlation rules with Jaccard distances to improve the similarity between users. Next, we propose a clustering method suitable for MDF. Finally, the basic K-mode algorithm is improved by the similarity measure method combining the correlation rule with the Jaccard distance and the cluster center update method which is the ARMDKM algorithm proposed in this paper. This method solves the problem that the MDF cannot be effectively processed in the traditional model and demonstrates its theoretical correctness. This experiment verifies the correctness of the new method by clustering purity, entropy, contour, and other indicators. |
url |
http://dx.doi.org/10.1155/2021/5538677 |
work_keys_str_mv |
AT beizhang precisionmarketingmethodofecommerceplatformbasedonclusteringalgorithm AT luquanwang precisionmarketingmethodofecommerceplatformbasedonclusteringalgorithm AT yuanyuanli precisionmarketingmethodofecommerceplatformbasedonclusteringalgorithm |
_version_ |
1714785450298703872 |