An Efficient High Utility Pattern Mining for Finding Time Based Customer Purchase Behavior

Author(s):  
V. S. Aziya Shirin ◽  
Joona George
IEEE Access ◽  
2021 ◽  
pp. 1-1
Author(s):  
Rashad S. Almoqbily ◽  
Azhar Rauf ◽  
Fahmi H. Quradaa
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.


2021 ◽  
Author(s):  
Md Motaher Hossain ◽  
Youxi Wu ◽  
Philippe Fournier-Viger ◽  
Zhao Li ◽  
Lei Guo ◽  
...  

Author(s):  
S. Jevalaksshmi ◽  
K. Hema Shankari ◽  
S. Mathivilasini ◽  
T.Nusrat Jabeen ◽  
K. Maheswari ◽  
...  
Keyword(s):  

IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 40714-40722 ◽  
Author(s):  
Jerry Chun-Wei Lin ◽  
Yuanfa Li ◽  
Philippe Fournier-Viger ◽  
Youcef Djenouri ◽  
Ji Zhang

Author(s):  
Logeswaran K. ◽  
Suresh P. ◽  
Savitha S. ◽  
Prasanna Kumar K. R.

In recent years, the data analysts are facing many challenges in high utility itemset (HUI) mining from given transactional database using existing traditional techniques. The challenges in utility mining algorithms are exponentially growing search space and the minimum utility threshold appropriate to the given database. To overcome these challenges, evolutionary algorithm-based techniques can be used to mine the HUI from transactional database. However, testing each of the supporting functions in the optimization problem is very inefficient and it increases the time complexity of the algorithm. To overcome this drawback, reinforcement learning-based approach is proposed for improving the efficiency of the algorithm, and the most appropriate fitness function for evaluation can be selected automatically during execution of an algorithm. Furthermore, during the optimization process when distinct functions are skillful, dynamic selection of current optimal function is done.


Sign in / Sign up

Export Citation Format

Share Document