1. R. Agrawal, R. Srikant, Fast algorithms for mining association rules in large databases, in: J.B. Bocca, M. Jarke, C. Zaniolo (Eds.), Proceedings of the 20th International Conference on Very Large Data Bases (VLDB’94), Santiago de Chile, Chile, 1994, pp. 487–499.
2. Fast discovery of association rules;Agrawal,1996
3. H. Toivonen, Sampling large databases for association rules, in: T.M. Vijayaraman, A.P. Buchmann, C. Mohan, N.L. Sarda (Eds.), Proceedings of the 22nd International Conference on Very Large Data Bases (VLDB’96), Bombay, India, 1996, pp. 134–145.
4. S. Brin, R. Motwani, J.D. Ullman, S. Tsur, Dynamic itemset counting and implication rules for market basket data, in: J. Peckham (Ed.), Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD’97), Tucson, AZ, USA, 1997, pp. 255–264.
5. A tree projection algorithm for finding frequent itemsets;Agarwal;J. Parallel Distrib. Comput.,2001