.png){kind=icon}
.png){kind=icon}
Return
High utility itemset mining using binary differential evolution: An application to customer segmentation
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2021.115122.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, high utility itemset mining (HUIM) algorithms driven by Binary Differential Evolution (BDE) and an Adaptive Binary Differential Evolution (ABDE) are proposed separately. These are compared with the HUIM algorithms of (i) Binary Particle Swarm Optimization, (ii) Genetic Algorithm and (iii) a two-phase HUIM found in the literature. The proposed HUIM algorithms are applied on seven datasets, where OnlineRetail dataset is a reallife dataset and the objective there is to segment high value customers based on monetary value. From the results, it is clear that BDE based HUIM outperformed the extant algorithms in literature and also the ABDE HUIM algorithm on all datasets with respect to the maximum number of itemsets mined.
Keywords:
High utility itemset mining
Customer segmentation
Binary differential evolution
Adaptive binary differential evolution
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.5
Papers:
2.9W
Citations:
10.2W