2[1]R Agrawal, T Imielinski, A Swami. Mining Association Rules between Sets of Items in Large Databases [C]. In Proc. of the ACM SIGMOD Int' I Conf. on Management of Data (ACM SIGMOD'93), Washington, USA,1993.207-216.
3[2]R Agrawal et al. Fast Algorithms for Mining Association Rules [C]. In Proc. of the 20th Int'l Conf. on Very Large Databases (VLDB'94), Santiago, Chile, 1994.487-499.
4[3]R Agrawal,R Srikant. Mining Sequential Patterns[C]. In Proc.of the Int'l Conf. on Data Engineering (ICDE), Taipei,Taiwan, 1995.3-14.
5[4]N F Ayan, A U Tansel, et al. Arkun. An Efficient Algorithm to Update Large Itemsets with Early Pruning[C]. In Proc. of the 5th Int'l Conf. on Knowledge Discovery and Data Mining (KDD'99), San Diego, California, USA,1999.439-450.
6[5]R J Bayardo Jr, et al. Constraint-based Rule Mining in Large,Dense Databases[C]. In Proc. of the 15th Int'l Conf. on Data Engineering, Sydney, Australia, 1999.85-93.
7[6]S Brin, R Motwani,C Silverstein. Beyond Market Baskets:Generalizing Association Rules to Correlations [C]. In Proc. of the ACM SIGMOD Iht'1 Conf. on Management of Data (ACM SIGMOD ' 97), 1997.265-276.
8[7]S Brin, et al. Dynamic Itemset Counting and Implication Rules for Market Basket Data[C]. In Proc. of the ACM SIGMOD Int'I Conf. on Management of Data, 1997. 123-140.
9[8]T Fukuda, Y. Morimoto, et al. Mining Optimized Association Rules for Numeric Attributes [C]. In Proc. of the 15th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems (PODS'96), Montreal, Canada, 1996.23-32.
10[9]J Han, J Pei,Y Yin. Mining Frequent Patterns Without Candidate Generation[C]. In Proc. of the 2000 ACM-SIGMOD Int'I Conf. on Management of Data, Dallas, Texas, USA,2000.1-12.
