{"id":9319,"date":"2026-07-25T19:40:26","date_gmt":"2026-07-25T11:40:26","guid":{"rendered":"\/jase\/?post_type=tkuisotope&p=9319"},"modified":"2026-07-25T22:24:04","modified_gmt":"2026-07-25T14:24:04","slug":"jase-202610-33-054","status":"publish","type":"tkuisotope","link":"\/jase\/?tkuisotope=jase-202610-33-054","title":{"rendered":"Precision Marketing Analysis Based on HC-KMEANS Algorithm"},"content":{"rendered":"\n
\n
\n

<\/i> 2026<\/a><\/p>\n<\/div>\n\n\n\n

\n

<\/i> Volume 33<\/a><\/p>\n<\/div>\n\n\n\n

\n
\n
\n
\n

Jingwen Li<\/i><\/a><\/p>\n\n\n\n

Hebi Vocational College of Energy and Chemistry, Hebi 458010, China<\/p>\n<\/div>\n\n\n\n

\n

Received: April 8, 2026
Accepted: May 25, 2026
Publication Date: July 25, 2026<\/p>\n<\/div>\n<\/div>\n\n\n\n

\"\u4e0a\u50b3\u5716\u7247\"\n\n\n

Schematic diagram of RFM model.<\/p>\n<\/div>\n<\/div>\n\n\n\n

<\/i> Copyright <\/strong>The Author(s). This is an open access article distributed under the terms of the Creative Commons Attribution License (CC BY 4.0)<\/a>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are cited.<\/p>\n\n\n\n

Download Citation:\u00a0 BibTeX <\/a>| http:\/\/dx.doi.org\/10.6180\/jase.202610_33.054<\/a>\u00a0\u00a0<\/p>\n\n\n\n

Download PDF<\/a><\/p>\n\n\n\n

<\/div>\n\n\n\n

In order to improve the sales level of e-commerce platform products and promote the healthy development of e-commerce platform, a construction method of e-commerce affective precision system based on Hierarchical Clustering K-means algorithm (HC K means) is proposed. This method first combines the weighted Euclidean distance with the Recency, Frequency, and Monetary (RFM) model and adopts an entropy-weighted method to improve the evaluation dimension of customer value. Further, the density index and the maximum-minimum distance method are introduced to optimize the selection of initial cluster centers, and a dynamic radius adjustment mechanism is designed to adapt to the data distribution, to solve the defects of the traditional algorithm being sensitive to the initial centers and having unstable clustering results. Experimental results based on 100,000 real transaction records from an e-commerce platform show that the HC K-means algorithm has a customer data classification detection rate of 91.83%, which is 10.86 and 6.54 percentage points higher than GMDA(80.%) and TSCEA (85.29%), respectively. The false detection rate is only 2.91%, which is lower than GMDA (5.86%) and TSCEA (8.92%). In customer value segmentation, the accuracy of potential customer value classification is 93%, the current value classification accuracy of core customers is 91%, and the customer loyalty classification accuracy is 93%. Main contributions: An improved HC K-means clustering framework is proposed, through density-guided initial center selection and dynamic radius adjustment, significantly improving the accuracy of e-commerce customer segmentation and marketing conversion efficiency, providing quantifiable decision support for enterprises\u2019 precise marketing.<\/p>\n\n\n\n

Keywords: Statistics; K-means clustering algorithm; e-commerce platform; affective precision; RFM system; HC K-means algorithm<\/em><\/p>\n\n\n\n

<\/div>\n\n\n\n
\n
\n
\n
\n
\n
    \n
  1. [1] Y. Wang, R. Zou, F. Liu, L. Zhang, and Q. Liu, (2021) \u201cA Review of Wind Speed and Wind Power Forecasting with Deep Neural Networks\u201d Applied Energy 304: 117766. DOI: 10.1016\/j.apenergy.2021.117766.<\/li>\n
  2. [2] A. Sarkar, A. Biswas, and M. Kundu, (2022) \u201cDevelopment of q-rung orthopair trapezoidal fuzzy Einstein aggregation operators and their application in MCGDM problems\u201d Journal of Computational and Cognitive Engineering 1(3): 109\u2013121. DOI: 10.47852\/bonviewJCCE2202162.<\/li>\n
  3. [3] J. Zoroja, I. Klopotan, and S. Ana-Marija, (2020) \u201cQuality of e-commerce practices in European enterprises: Cluster analysis approach\u201d Interdisciplinary Description of Complex Systems: INDECS 18(2-B): 312\u2013326. DOI: 10.7906\/indecs.18.2.17.<\/li>\n
  4. [4] A. Mukhayaroh, S. Marlina, S. Hartini, S. Muryani, A. Sinnun, S. Nurajizah, C. Adiwardaja, et al., (2020) \u201cImplementation of clustering algorithm method for customer segmentation\u201d Journal of Computational and Theoretical Nanoscience 17(2-3): 1388\u20131395. DOI: 10.1166\/jctn.2020.8815.<\/li>\n
  5. [5] K. H. Leung, D. Y. Mo, G. T. Ho, C.-H. Wu, and G. Q. Huang, (2020) \u201cModelling near-real-time order arrival demand in e-commerce context: a machine learning predictive methodology\u201d Industrial Management & Data Systems 120(6): 1149\u20131174. DOI: 10.1108\/IMDS-12-2019-0646.<\/li>\n
  6. [6] S. Sieranoja, (2019) \u201cHow much k-means can be improved by using better initialization and repeats?\u201d Pattern Recogn 93(04): DOI: 10.1016\/j.patcog.2019.04.014.<\/li>\n
  7. [7] Y. Huang. \u201cResearch on e-commerce precision marketing strategy based on big data technology\u201d. In: 2021 2nd International Conference on E-Commerce and Internet Technology (ECIT). IEEE. 2021, 87\u201390. DOI: 10.1109\/ECIT52743.2021.00026.<\/li>\n
  8. [8] W. Jun, S. Li, Y. Yanzhou, E. D. S. Gonzalezc, H. Weiyi, S. Litao, and Y. Zhang, (2021) \u201cEvaluation of precision marketing effectiveness of community e-commerce\u2014An AISAS based model\u201d Sustainable Operations and Computers 2: 200\u2013205. DOI: 10.1016\/j.susoc.2021.07.007.<\/li>\n
  9. [9] S. Wang and Y. Yang, (2021) \u201cM-GAN-XGBOOST model for sales prediction and precision marketing strategy making of each product in online stores\u201d Data Technologies and Applications 55(5): 749\u2013770. DOI: 10.1108\/DTA-11-2020-0286.<\/li>\n
  10. [10] X. Yang, P. Gong, et al., (2020) \u201cMarketing strategy of green agricultural products based on consumption intention\u201d Agricultural & Forestry Economics and Management 3: 16\u201324. DOI: 10.23977\/agrfem.2020.030103.<\/li>\n
  11. [11] R. P. Chatterjee, K. Deb, S. Banerjee, A. Das, and R. Bag, (2019) \u201cWeb mining using k-means clustering and latest substring association rule for e-commerce\u201d Journal of Mechanics of Continua and Mathematical Sciences 14(6): 28\u201344. DOI: 10.26782\/jmcms.2019.12.00003.<\/li>\n
  12. [12] H. Liu, J. Chen, J. Dy, and Y. Fu, (2023) \u201cTransforming complex problems into K-means solutions\u201d IEEE transactions on pattern analysis and machine intelligence 45(7): 9149\u20139168. DOI: 10.1109\/TPAMI.2023.3237667.<\/li>\n
  13. [13] J. Niu, (2021) \u201cIntelligent evaluation model of e-commerce transaction volume based on the combination of k-means and SOM algorithms\u201d International Journal of Information and Communication Technology 18(2): 189\u2013206. DOI: 10.1504\/ijict.2021.113043.<\/li>\n
  14. [14] P. Wang, B. Cao, T. Ma, B. Wang, Q. Zhang, and P. Zheng, (2023) \u201cDUHI: Dynamically updated hash index clustering method for DNA storage\u201d Computers in Biology and Medicine 164: 107244. DOI: 10.1016\/j.compbiomed.2023.107244.<\/li>\n
  15. [15] D. K. Sharma, S. Lohana, S. Arora, A. Dixit, M. Tiwari, and T. Tiwari, (2022) \u201cE-Commerce product comparison portal for classification of customer data based on data mining\u201d Materials Today: Proceedings 51: 166\u2013171. DOI: 10.1016\/j.matpr.2021.05.068.<\/li>\n
  16. [16] H. P. Patra and K. Nikitha, (2022) \u201cAnalyse k-means algorithm and implementing a new clustering algorithm\u201d International Journal of Computational Systems Engineering 6(4): 178\u2013181. DOI: 10.1504\/IJSYSE.2021.120288.<\/li>\n
  17. [17] S. S. Prasetyo, M. Mustafid, and A. R. Hakim, (2020) \u201cPenerapan fuzzy c-means kluster untuk segmentasi pelanggan e-commerce dengan metode recency frequency monetary (rfm)\u201d Jurnal Gaussian 9(4): 421\u2013433. DOI: 10.14710\/j.gauss.v9i4.29445.<\/li>\n
  18. [18] S. N. Sharma and P. Sadagopan, (2022) \u201cInfluence of conditional holoentropy-based feature selection on automatic recommendation system in E-commerce sector\u201d Journal of King Saud University-Computer and Information Sciences 34(8): 5564\u20135577. DOI: 10.1016\/j.jksuci.2020.12.022.<\/li>\n
  19. [19] M. Rezaei and P. Fr\u00e4nti, (2023) \u201cK-sets and k-swaps algorithms for clustering sets\u201d Pattern Recognition 139: 109454. DOI: 10.1016\/j.patcog.2023.109454.<\/li>\n
  20. [20] P. Fr\u00e4nti and S. Sieranoja, (2023) \u201cK-means properties on six clustering benchmark datasets: P. Fr\u00e4nti, S. Sieranoja\u201d Applied intelligence 48(12): 4743\u20134759. DOI: 10.1007\/s10489-018-1238-7.<\/li>\n
  21. [21] W. Haibin, G. Xin, Y. Xiao, L. Shuangming, and S. Guidong, (2024) \u201cA GMDA clustering algorithm based on evidential reasoning architecture\u201d Chinese Journal of Aeronautics 37(1): 300\u2013311. DOI: 10.1016\/j.cja.2023.09.015.<\/li>\n
  22. [22] C. Liu and S. Yang, (2024) \u201cA two-stage clustering ensemble algorithm applicable to risk assessment of railway signaling faults\u201d Expert Systems with Applications 249: 123500. DOI: 10.1016\/j.eswa.2024.123500.<\/li>\n
  23. [23] P. Fr\u00e4nti, (2018) \u201cEfficiency of random swap clustering\u201d Journal of big data 5(1): 1\u201329. DOI: 10.1186\/s40537-018-0122-y.<\/li>\n
  24. [24] A. Rodriguez and A. Laio, (2014) \u201cClustering by fast search and find of density peaks\u201d science 344(6191): 1492\u20131496. DOI: 10.1126\/science.1242072.<\/li>\n
  25. [25] S. Sieranoja and P. Fr\u00e4nti, (2010) \u201cFast and general density peaks clustering\u201d Pattern recognition letters 128: 551\u2013558. DOI: 10.1016\/j.patrec.2019.10.019.<\/li>\n<\/ol>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n\n\n\n

    <\/p>\n","protected":false},"author":3,"template":"wp-custom-template-detail-4-aricles","meta":{"_uag_custom_page_level_css":""},"categories":[12,1483,6],"tags":[1668],"acf":[],"uagb_featured_image_src":[],"uagb_author_info":{"display_name":"\u6797\u923a\u6db5","author_link":"\/jase\/?author=3"},"uagb_comment_info":0,"uagb_excerpt":" Copyright The Author(s). This is an open access article distributed under the terms of the Creative Commons Attribution License (CC BY 4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are cited. Download Citation:\u00a0 BibTeX | http:\/\/dx.doi.org\/10.6180\/jase.202610_33.054\u00a0\u00a0 Download PDF In order to improve the sales level of e-commerce platform products…","_links":{"self":[{"href":"\/jase\/index.php?rest_route=\/wp\/v2\/tkuisotope\/9319"}],"collection":[{"href":"\/jase\/index.php?rest_route=\/wp\/v2\/tkuisotope"}],"about":[{"href":"\/jase\/index.php?rest_route=\/wp\/v2\/types\/tkuisotope"}],"author":[{"embeddable":true,"href":"\/jase\/index.php?rest_route=\/wp\/v2\/users\/3"}],"wp:attachment":[{"href":"\/jase\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=9319"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"\/jase\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=9319"},{"taxonomy":"post_tag","embeddable":true,"href":"\/jase\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=9319"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}