4Agrawal R, Imielinski T, Swami A. Mining Association Rules between Sets of Items in Large Databases[C]//Proceedings of the 1993 ACM SIGMOD Conference. Washington D C: [ s. n ], 1993: 207 - 216.
5Agrawal. R,Srikant R. Fast Algorithm for Mining Association Rules[C]//Proceedings of the 20th Very Large Data Bases (VLDB' 94) Conference. Santiago, Chile: [ s. n. ], 1994: 487 - 499.
6Agrawal R,Srikant R. Fast Algorithm for Mining Association Rules in Large Databases[R]. San Jose, CA: IBM Almaden Research Center, 1994.
7Park J S, Chen M S, Yu P S. An effective hash based algorithm for mining association rules[ C]//In: Proc. 1995 ACM SIGMOD. San Jose, CA: [ s. n. ], 1995 : 175 - 186.
8Han J, Pei j, Yin Y. Mining frequent patterns without candidate generation [ C]//In Proceeding of the 2000 ACM SIGMOD Conference on Managerment of Data. Dallas, TX: [s, n. ] ,2000,.
9Liu J ,Pan Y,Wang K,et al. Mining frequent item sets by opportunisitc projection[ C]//Proc. of the Eighth ACM SIGKDD Intl. Conf on Knowledge Discovery and Data Mining. Alberta, Canada: [s. n. ] ,2002:229 - 238.
10Agarwal R, Aggarwal C, Prased V V V. A tree projection algorithm for generation of frequent itemsets[ J ]. J. Parallel and Distilbuted Computing, 2001,61 ( 3 ) : 350 - 371.
