Elżbieta Pawełek-Lubera , Mateusz Przyborowski , Dominik Ślęzak , Adam Wasilewski
{"title":"Multi-criteria selection of data clustering methods for e-commerce personalization","authors":"Elżbieta Pawełek-Lubera , Mateusz Przyborowski , Dominik Ślęzak , Adam Wasilewski","doi":"10.1016/j.asoc.2025.113559","DOIUrl":null,"url":null,"abstract":"<div><div>E-commerce platforms increasingly rely on personalization to improve the user experience and drive sales, requiring efficient data clustering methods to segment users based on their behavior and preferences. However, due to the many data clustering techniques available, the key decision problem is to choose the optimal grouping method. Decision making based on single decision factors, although widely used, can lead to wrong decisions, so it is worth considering multi-criteria analysis tailored to the specifics of e-commerce customer clustering. Through extensive experiments on real e-commerce datasets, the study demonstrates the strengths and limitations of selected data clustering techniques (including the Approximated Gaussian Mixture Model, which was found to be superior to the classical Gaussian Mixture Model), considering different decision criteria related to various aspects of quality. The results provide valuable insights for e-commerce practitioners seeking to optimize their personalization strategies and ultimately suggest that a novel adaptation of the PROMETHEE II method can provide a robust framework for making informed decisions about selection of data clustering algorithms.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"182 ","pages":"Article 113559"},"PeriodicalIF":6.6000,"publicationDate":"2025-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Soft Computing","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1568494625008701","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0
Abstract
E-commerce platforms increasingly rely on personalization to improve the user experience and drive sales, requiring efficient data clustering methods to segment users based on their behavior and preferences. However, due to the many data clustering techniques available, the key decision problem is to choose the optimal grouping method. Decision making based on single decision factors, although widely used, can lead to wrong decisions, so it is worth considering multi-criteria analysis tailored to the specifics of e-commerce customer clustering. Through extensive experiments on real e-commerce datasets, the study demonstrates the strengths and limitations of selected data clustering techniques (including the Approximated Gaussian Mixture Model, which was found to be superior to the classical Gaussian Mixture Model), considering different decision criteria related to various aspects of quality. The results provide valuable insights for e-commerce practitioners seeking to optimize their personalization strategies and ultimately suggest that a novel adaptation of the PROMETHEE II method can provide a robust framework for making informed decisions about selection of data clustering algorithms.
期刊介绍:
Applied Soft Computing is an international journal promoting an integrated view of soft computing to solve real life problems.The focus is to publish the highest quality research in application and convergence of the areas of Fuzzy Logic, Neural Networks, Evolutionary Computing, Rough Sets and other similar techniques to address real world complexities.
Applied Soft Computing is a rolling publication: articles are published as soon as the editor-in-chief has accepted them. Therefore, the web site will continuously be updated with new articles and the publication time will be short.