3Park J S,Chen M S,Yu P S.An effective hash based algorithm for mining association rules[C]//Proc 1995 ACM-SIGMOD,San Jose, CA,Feb 1995:175-186.
4Han J,Pei J,YIN Y W,et al.Mining frequent patterns without candidate generation[J].Data Mining and Knowledge Discovery,2004,8: 53-87.
5Liu Junqiang,Pan Yunhe,Wang Ke,et al.Mining frequent item sets by opportunistic projection[C]//Proc of the Eighth ACM SIGKDD Int Conf on Knowledge Discovery and Data Mining,Alberta,Canada, July, 2002 : 229-238.
6Agrawal R, Srikant R. Fast algorithm for Mining asso- ciation rules in large databases[C]//Proceedings of the 20th VLDB Conference. Santiago, Chile: IEEE, 1994 : 487-499.
8Chen C, Shen J, Chert B, et al. An improvement Apriori arithmetic based on rough set theory. 2011 Third Pacific Asia Conference on circuits, Communications and System. 2011.1-3.
9Chen Z, Cai S, Song Q, et al. An improved Apriori algorithm based on pruning optimization and transaction reduction. 2nd International Conference on Artificial Intelligence, Management Science and Electronic Commerce. 2011. 1908-1911.
10Burdick D, Calimlim M, Flannick J, et al. Mafia: A maximal frequent itemset algorithm. IEEE Trans. on Knowledge and Data Engineering, 2005, 17(11): 1490-1504.
