1S. Brin, R. Motwani, J.D. UIIman, and S. Tsur, "Dynamic Itemset Counting andlmplication Rules for Market Basket Data", 1997 ACM SIGMOD Conference on Management of Data, pp. 255 -264, 1997.
2J. Tang," Using Incremental Pruning to Increase the Efficiency of Dynamic ItemsetCounting for Mining Association Rules", Proceedings of the 1998 ACM 7th international conference on Information and knowledge management , pp. 973-980,1998.
3J. Hanand J. Pei. Mining "Frequent Patterns by Pattern - Growth: Methodology andlmplications". ACM SIGKDD Explorations (Special Issue on Scaleble Data Mining AIgorithms), December 2000.
4Chang - Hung Lee, Cheng - Ru Lin, and Ming - Syan Chen "Sliding - Window Filtering: An EfficientAlgorithm forlncremental Mining" SIGKDD 2001.
4Hu Huirong. Fast algorithm to discovering sequential patterns from large databases[C]. Proceeding of the 24th Chinese Control Conference,2005.
5Cormen T, Leiserson C, Rivest R,et al. Introduction to algorithms[M]. MIT Press, 2001.
6Montresor A.Anthill:A framework for the design and analysis of peer-to peer systems[C]. Bertinoro,Italy:Proc 4th European Research Seminar on Advances in Distributed Systems,2001.
