Incrementally Mining Recently Repeating Patterns over Data Streams
Repeating patterns represent temporal relations among data items, which could be used for data summarization and data prediction. More and more data of various applications is generated as a data stream. Based on time sensitive concern, mining repeating patterns from the whole history data sequence of a data stream does not extract the current trend of patterns over the stream. Therefore, the traditional strategies for mining repeating patterns on static database are not applicable to data streams. For this reason, an algorithm, named appearing-bit-sequence-based incremental mining algorithm, for efficiently discovering recently repeating patterns over a data stream is proposed in this paper. The appearing bit sequences are used to monitor the occurrences of patterns within a sliding window. Two versions of algorithms are proposed by maintaining the appearing bit sequences of maximum repeating patterns and closed repeating patterns, respectively. Accordingly, the cost of re-mining repeating patterns over a sliding window is reduced to that of monitoring frequency changes of the maintained patterns. The experimental results show that the incremental mining methods perform much better than the re-miming approach.
Keywordsrepeating patterns incremental mining data streams
Unable to display preview. Download preview PDF.
- 1.Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules. In: Proc. of Int. Conf. on Very Large Data Bases (1994)Google Scholar
- 2.Chang, J.H., Lee, W.S.: Finding Recent Frequent Itemsets Adaptively over Online Data Streams. In: Proc. the 9th ACM International Conference on Knowledge Discovery and Data Ming (2003)Google Scholar
- 3.Chi, Y., Wang, H., Yu, P.S., Muntz, R.R.: Moment: Maintaining Closed Frequent Itemsets over a Stream Sliding Window. In: Proc. Int. Conf. on Data Mining (ICDM 2004) (2004)Google Scholar
- 4.Domingos, P., Hulten, G.: Mining high-speed data streams. In: Proc. The 6th ACM International Conference on Knowledge Discovery and Data Ming (2000)Google Scholar
- 5.Hsu, J.L., Liu, C.C., Chen, A.L.P.: Discovering Nontrivial Repeating Patterns in Music Data. IEEE Transactions on Multimedia (2001)Google Scholar
- 8.Li, H., Lee, S., Shan, M.K.: Online Mining (Recently) Maximal Frequent Itemsets over Data Streams. In: Proc. of RIDE-SDMA 2005 (2005)Google Scholar
- 9.Lin, C.H., Chiu, D.Y., Wu, Y.H., Chen, A.L.P.: Mining Frequent Itemsets from Data Streams with a Time-Sensitive Sliding Window. In: Proc. SIAM International Conference on Data Mining (2005)Google Scholar
- 11.Manku, G.S., Chen Motwani, R.: Approximate Frequent Counts over Data Streams. In: Proc. of the 28th International Conference on Very Large Database (2002)Google Scholar
- 12.Wand, H., Fan, W., Yu, P.S., Han, J.: Mining Concept Drifting Data Streams using Ensemble Classifiers. In: Proc. the 9th ACM International Conference on Knowledge Discovery and Data Ming (2003)Google Scholar