EFIM: a fast and memory efficient algorithm for high-utility itemset mining

2016 ◽  
Vol 51 (2) ◽  
pp. 595-625 ◽  
Author(s):  
Souleymane Zida ◽  
Philippe Fournier-Viger ◽  
Jerry Chun-Wei Lin ◽  
Cheng-Wei Wu ◽  
Vincent S. Tseng
Author(s):  
Souleymane Zida ◽  
Philippe Fournier-Viger ◽  
Jerry Chun-Wei Lin ◽  
Cheng-Wei Wu ◽  
Vincent S. Tseng

2020 ◽  
Vol 28 (1) ◽  
pp. 19-32 ◽  
Author(s):  
Philippe Fournier-Viger ◽  
Yimin Zhang ◽  
Jerry Chun-Wei Lin ◽  
Duy-Tai Dinh ◽  
Hoai Bac Le

Abstract Discovering high-utility itemsets (HUIs) consists of finding sets of items that yield a high profit in customer transaction databases. An important limitation of traditional high-utility itemset mining (HUIM) is that only the utility measure is used for assessing the interestingness of patterns. This leads to finding several itemsets that have a high profit but contain items that are weakly correlated. To address this issue, this paper proposes to integrate the concept of correlation in HUIM to find profitable itemsets that are highly correlated, using the all-confidence and bond measures. An efficient algorithm named FCHM (fast correlated high-utility itemset miner) is proposed to efficiently discover correlated high-utility itemsets (CHIs). Two versions of the algorithm are proposed: FCHM$_{all\text{-}confidence}$ and FCHM$_{bond}$, which are based on the all-confidence and bond measures, respectively. An experimental evaluation was done using four real-life benchmark datasets from the HUIM literature: mushroom, retail, kosarak and foodmart. Results show that FCHM is efficient and can prune a huge amount of weakly CHIs.


2021 ◽  
pp. 107422
Author(s):  
Jerry Chun-Wei Lin ◽  
Youcef Djenouri ◽  
Gautam Srivastava ◽  
Unil Yun ◽  
Philippe Fourier-Viger
Keyword(s):  

Author(s):  
Amit Verma ◽  
Siddharth Dawar ◽  
Raman Kumar ◽  
Shamkant Navathe ◽  
Vikram Goyal
Keyword(s):  

Author(s):  
Jimmy Ming-Tai Wu ◽  
Qian Teng ◽  
Shahab Tayeb ◽  
Jerry Chun-Wei Lin

AbstractThe high average-utility itemset mining (HAUIM) was established to provide a fair measure instead of genetic high-utility itemset mining (HUIM) for revealing the satisfied and interesting patterns. In practical applications, the database is dynamically changed when insertion/deletion operations are performed on databases. Several works were designed to handle the insertion process but fewer studies focused on processing the deletion process for knowledge maintenance. In this paper, we then develop a PRE-HAUI-DEL algorithm that utilizes the pre-large concept on HAUIM for handling transaction deletion in the dynamic databases. The pre-large concept is served as the buffer on HAUIM that reduces the number of database scans while the database is updated particularly in transaction deletion. Two upper-bound values are also established here to reduce the unpromising candidates early which can speed up the computational cost. From the experimental results, the designed PRE-HAUI-DEL algorithm is well performed compared to the Apriori-like model in terms of runtime, memory, and scalability in dynamic databases.


Sign in / Sign up

Export Citation Format

Share Document