英文摘要 |
Mining sequential patterns is to find the sequential purchasing behaviors for most of the customers in the transaction database. We can predict the products that the customer may purchase next time based on the products that the customer currently purchases. Owing to the transactions will continuously increase over time, and the old transactions also need to be deleted. How to update the original sequential patterns efficiently in a data stream environment is an important research topic, because if the data is changed quickly, but the original sequential patterns cannot be updated immediately, the discovered Information may no longer represent the current consumer behaviors. Therefore, in this paper, we propose an algorithm for efficiently mining sequential patterns in a data stream. When the transactions are added or removed, our algorithms only need to process the inserted or deleted transactions without scanning the original database. Experimental results also show that our algorithms outperform the previous approaches. |