Pre-large based high utility pattern mining for transaction insertions in incremental database

• Published in: Knowledge-based systems Vol. 268; p. 110478
• Main Authors: Kim, Hyeonmo, Lee, Chanhee, Ryu, Taewoong, Kim, Heonho, Kim, Sinyoung, Vo, Bay, Lin, Jerry Chun-Wei, Yun, Unil
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 23.05.2023
• Subjects: Data mining; High-utility pattern; Incremental database; Pattern mining; Pre-large; High-utility pattern; Pattern mining; Incremental database; Data mining; Pre-large
• ISSN: 0950-7051; 1872-7409
• DOI: 10.1016/j.knosys.2023.110478

High utility pattern mining has been actively researched and applied to diverse applications because it can process the database by considering the quantity and importance of items. However, traditional high utility pattern mining methods aim to handle static databases, so they cannot meet the requirements of users who want to process the dynamic environments. Although methods to process incremental databases have been proposed, they have limitations that they perform the mining process on the entire database, including already processed data, whenever data are newly inserted. The pre-large concept is one of the techniques to process the dynamic database. Utilizing the pre-large technique, we can efficiently handle the transaction insertion using the extracted patterns of the previous mining process. In this paper, we propose a novel pre-large-based approach to discover high utility patterns from incremental databases. A list structure is proposed to store the utility information of patterns, so candidate patterns are not generated, and an additional database scan is not required. Performance evaluation performed on various real and synthetic datasets shows that the proposed algorithm is more efficient and effective than the latest approaches in a dynamic environment.