Single-pass based efficient erasable pattern mining using list data structure on dynamic incremental databases

Abstract Many different approaches of data mining have been proposed to satisfy various demands of users. Erasable pattern mining is one of the interesting areas in frequent pattern mining, which was proposed to diagnose and solve financial problems caused in industrial fields. Since its original concept emerged, various relevant approaches have been devised. Analyzing incremental data becomes more important because interesting data are continually accumulated in various application fields including industrial areas. For this reason, an incremental method for erasable pattern mining has also been suggested in order to reflect such a trend. Since incremental data become gradually larger and more complicated with the passage of time, it is important to process such data as quickly and efficiently as possible. However, the previous method has limitations in this respect. Motivated by this challenge, we propose a new incremental erasable pattern mining algorithm including new data structures and mining techniques for efficient incremental data processing. We also demonstrate that the proposed method outperforms previous state-of-the-art approaches through extensive, empirical performance tests.