Clusterization methods for multi-variant e-commerce interfaces
Adam Wasilewski
DOI: http://dx.doi.org/10.15439/2023F1377
Citation: Proceedings of the 18th Conference on Computer Science and Intelligence Systems, M. Ganzha, L. Maciaszek, M. Paprzycki, D. Ślęzak (eds). ACSIS, Vol. 35, pages 309–313 (2023)
Abstract. E-commerce is a very popular method that let consumers to purchase goods and services. The ability to purchase items online has increased the need for effective recommendation systems. Such recommendations relate usually to products in which the customer may be interested. However, there are wider opportunities to tailor e-commerce to individual customer needs and behaviour. In this paper the architecture of the ecommerce platform (named AIM2), which allows to provide a dedicated interface to selected user groups is discussed. A key component of the platform is the module responsible for dividing customers into groups, using selected clustering methods. Each of the implemented methods can be parameterised to adapt the customer segmentation to the requirements of the e-commerce owner. This article describes the results of an analysis of the impact of selected methods and parameters on clustering results. Moreover, it identifies key metrics that should be considered when selecting clustering conditions during the implementation of the platform. Finally, the main results of the pilot implementation of AIM2 are presented to assess the effectiveness of the multivariant user interface.
References
- J. Ah-Pine, “An Efficient and Effective Generic Agglomerative Hierarchical Clustering Approach”. Journal of Machine Learning Research vol 19(1), 2018, pp. 1615-1658.
- F. Andriyani, Y. Puspitarani “Performance Comparison of K-Means and DBScan Algorithms for Text Clustering Product Reviews”, SinkrOn vol. 7(3), 2022, pp. 944-949.
- L. Ardissono, A. Goy, G. Petrone, M. Segnan “A multi-agent infrastructure for developing personalized web-based systems” ACM Transactions on Internet Technology vol. 5(1), 2005, pp. 47-69.
- D. Arthur, S. Vassilvitskii “k-means++: the advantages of careful seeding”, SODA ’07: Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, 2007, pp. 1027-1035.
- R.P. Chatterjee, K. Deb, S. Banerjee, A. Das, R. Bag “Web Mining Using K-Means Clustering and Latest Substring Association Rule for E-Commerce”, Journal of Mechanics of Continua and Mathematical Sciences vol. 14(6), 2019, pp. 28-44.
- X. Chen, W. Sun, B. Wang, Z. Li, X. Wang, Y. Ye “Spectral Clustering of Customer Transaction Data With a Two-Level Subspace Weighting Method” IEEE Transactions on Cybernetics vol. 49, 2019, pp. 3230.
- Darwin, R. Purba, M.F. Pasha “Search Query Clustering Comparation On E-Commerce Using K-Means And Adaptive DBSCAN” 3rd International Conference on Mechanical, Electronics, Computer, and Industrial Technology (MECnIT), 2020, pp. 207-211.
- M. Ester, H.-P. Kriegel, J. Sander, X. Xu “A density-based algorithm for discovering clusters in large spatial databases with noise”, KDD’96: Proceedings of the Second International Conference on Knowledge Discovery and Data Mining, 1996, pp. 226-231.
- F. Gözükara, S.A. Özel “An Incremental Hierarchical Clustering Based System For Record Linkage In E-Commerce Domain” The Computer Journal vol. 66(3), 2021, pp. 581-602.
- P.D.Hung, N.T.T. Lien, N.D. Ngoc “Customer Segmentation Using Hierarchical Agglomerative Clustering” ICISS ’19: Proceedings of the 2nd International Conference on Information Science and Systems, 2019, pp. 33-37.
- P. Jiang, Y. Zhu, Y. Zhang, Q. Yuan “Life-stage Prediction for Product Recommendation in E-commerce” KDD ’15: Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2015, pp. 1879-1888.
- A. Kobsa, “Personalized hypermedia and international privacy” Communications of the ACM vol. 45, 2002, pp. 64-67.
- R.V.S. Kumar, S.S. Rao, P. Srinivasrao “An Efficient Clustering Approach using DBSCAN” Helix vol. 8(3), 2018, pp. 3399-2305.
- L. McInnes, J. Healy, J. Melville “UMAP: Uniform Manifold Approximation and Projection for Dimension Reduction” ArXiv e-prints, 2020, https://arxiv.org/pdf/1802.03426
- M. Montaner, B. López, J. L. de la Rosa “A Taxonomy of Recommender Agents on the Internet” Artificial Intelligence Review vol. 19, 2003, pp. 285-330.
- E. Patel, D.S. Kushwaha “Clustering Cloud Workloads: K-Means vs Gaussian Mixture Model” Artificial Procedia Computer Science vol. 171, 2020, pp. 158-167.
- K. Tabianan, S. Velu, V. Ravi “K-Means Clustering Approach for Intelligent Customer Segmentation Using Customer Purchase Behavior Data”, Sustainability vol. 14(12), 2022, pp. 1-15.
- E. Triandini, F.A. Hermawati, I.K.P. Suniantara “Hierarchical Clustering for Functionalities E-Commerce Adoption”, Jurnal Ilmiah KURSOR vol. 10(3), 2020, pp. 111-118.
- Y. Yang, J. Jiang, H. Wang “Application of E-Commerce Sites Evaluation Based on Factor Analysis and Improved DBSCAN Algorithm”, International Conference on Management of e-Commerce and e-Government, 2018, pp. 33-38.
- L. Wang, Y. Jing “Collocating Recommendation Method for E-Commerce Based on Fuzzy C-Means Clustering Algorithm”, Journal of Mathematics vol. 2022, 2022, pp. 1-11.
- Z. Wu, L. Jin, J. Zhao, L. Jing, L. Chen “Research on Segmenting E-Commerce Customer through an Improved K-Medoids Clustering Algorithm”, Computational Intelligence and Neuroscience vol. 2022, 2022, pp. 1-10.
- B. Zhang, L. Wang, Y. Li “Precision Marketing Method of E-Commerce Platform Based on Clustering Algorithm”, Complexity vol. 2021, 2021, pp. 1-10.
- Y. Zhang, M. Li, S. Wang, S. Dai, L. Luo, E. Zhu, H. Xu, X, Zhu, C. Yao, H. Zhou “Gaussian Mixture Model Clustering with Incomplete Data”, ACM Transactions on Multimedia Computing, Communications, and Applications vol. 17(1s), 2021, pp. 1-14.