In this paper, we present an incremental mining algorithm for handling the mining problem from inserted transactions. The algorithm is based on the Dynamic Bit-Vector (DBV) structure and pre-large item sets. The DBV structure facilitates the processes for maintaining large and pre-large item sets. The pre-large concept is used to reduce the number of database scans. The experimental results show that the proposed algorithm is faster than some other algorithms.
['Bac Le', 'Thien-Phuong Le', 'Bay Vo', 'Tzung-Pei Hong']
Maintenance of DBV-Trees for Transaction Insertion