Updating the Sequential Patterns in Dynamic Databases for Customer Sequences Deletion

In the past, an FUSP-tree algorithm for inserting customer sequences was proposed for handling the customer sequences insertion. In this paper, the FUSP-tree construction algorithm is thus modified for efficiently handling the deletion of customer sequences. A decremental FUSP-tree algorithm for sequences deletion (FUSP-DEL) is thus proposed for reducing the execution time of re-constructing the tree while the customer sequences are deleted in the original database. Experimental results show that the proposed FUSP-DEL algorithm has a good performance in both of the time and space complexity.