3Agrawal R,Imielinski T,Swami A.Mining association rules between sets of items in large databases[C]∥Proceedings of the ACM SIGMOD conference on management of data.New York:ACM,1993:207-216.
4Agrawal R,SriKant R.Fast algorithms for mining association for mining association rules[C]∥Proceeding of the 20th international Conference on very large database.[s.1]:Morgan kaufman Pub Inc,1994:487-499.
5Park J S,Chen M S,Yu P S.Efficient parallel data mining of association rules[C]∥ 4th International Conference on Information and Knowledge Management.New York:ACM,1995:31-36.
6Park J S,Chen M S,Yu P S.An effective hash-based algorithm for mining association rules[C]∥Proceedings of ACM SIGMOD International Conference on Management of Data.New York:ACM,1995:175-186.
7Savasere A,Omiecinski E,Navathe S.An efficient algorithm for mining association rules in large databases[C]∥Proceedings of the 21st International Conference on Very large Database.New York:ACM,1995:432-443.
8Toivonen H.Sampling large databases for association rules[C]∥Proceedings of the 22nd International Conference on Very Large Database.Bombay,India:[s.n.],1996:134-145.
9Brin S,Motwani R,Ullman J D,et al.Dynamic Itemset Counting and Implication Rules for Market Basket Data[C]∥In Proceedings of the ACM SIGMOD International Conference on Management of Dat.New York:ACM,1997:255-264.
10Han J,Pei J,Yin Y et al.Mining Frequent Patterns without Candidate Generation[C].New York:[s.n.],2000:1-12.
