|| R. Agarwal, C. Aggarwal, and V.V.V. Prasad. A Tree Projection Algorithm for Generation of Frequent Itemsets. Jornal of Parallel and Distributed Computing (Special Issue on High Performance Data Mining), 2000.|
 R. Agrawal, T. Imielinski, and A. Swami. Mining Association Rules between Sets of Items in Large Databases. Proc.of ACMSIGMOD, pages 207—216, May 1993.
 R. Agrawal and R. Srikant. Fast Algorithms for Mining Association Rules in Large Databases. Proc. Of the 20th International Conference on Very Large Data Bases, pages 478—499, September 1994.
 N.F. Ayan, A.U. Tansel, and E. Arkun. An Ecient Algorithm to Update Large Itemsets with Early Pruning. Proc. of 1999 Int. Conf. on Knowledge Discovery and Data Mining, 1999.
 S. Brin, R. Motwani, J. D. Ullman, and S. Tsur. Dynamic Itemset Counting and Implication Rules for Market Basket Data. ACM SIGMOD Record, 26(2):255—264, May 1997.
 M.-S. Chen, J. Han, and P.S. Yu. Data Mining: An Overview from Database Perspective. IEEE Transactions on Knowledge and Data Engineering, 8(6):866—883, December 1996.
 M.-S. Chen, J.-S. Park, and P. S. Yu. Efficient Data Mining for Path Traversal Patterns. IEEE Transactions on Knowledge and Data Engineering, 10(2):209—221, April 1998.
 D. Cheung, J. Han, V. Ng, and C.Y. Wong. Maintenance of Discovered Association Rules in Large Databases: An Incremental Updating Technique. Proc. of 1996 Int’l Conf. on Data Engineering, pages 106—114, February 1996.
 D. Cheung, S.D. Lee, and B. Kao. A General Incremental Technique for Updating Discovered Association Rules. Proc. International Conference On Database Systems For Advanced Applications, April 1997.
 J. Han, L. V. S. Lakshmanan, and R. T. Ng. Constraint-Based, Multidimensional Data Mining. COMPUTER (special issues on Data Mining), pages 46—50, 1999.
 J. Han and J. Pei. Mining Frequent Patterns by Pattern-Growth: Methodology and Implications. ACM SIGKDD Explorations (Special Issue on Scaleble Data Mining Algorithms), December 2000.
 J. Han, J. Pei, B. Mortazavi-Asl, Q. Chen, U. Dayal, and M.-C. Hsu. FreeSpan: Frequent pattern-projected sequential pattern mining. Proc.of 2000 Int.Conf.on Knowledge Discovery and Data Mining, pages 355—359, August 2000.
 J. Hipp, U. Güntzer, and G. Nakhaeizadeh. Algorithms for association rule mining —a general survey and comparison. SIGKDD Explorations, 2(1):58—64, July 2000.
 L. V. S. Lakshmanan, R. Ng, J. Han, and A. Pang. Optimization of Constrained Frequent Set Queries with 2-Variable Constraints. Proc. of 1999 ACM-SIGMOD Conf. on Management of Data, pages 157—168, June 1999.
 C.-H. Lee, C.-R. Lin and M.-S. Chen. Sliding-Window Filtering: An Efficient Algorithm for Incremental Mining. Proc. of the ACM 10th Intern’’l Conf. on Information and Knowledge Management (CIKM-01), November 5-10, 2001.
 J.-L. Lin and M.H. Dunham. Mining Association Rules: Anti-Skew Algorithms. Proc.of 1998 Int’l Conf. on Data Engineering, pages 486—493, 1998.
 J.-S. Park, M.-S.Chen, and P.S.Yu. Using a Hash-Based Method with Transaction Trimming for Mining Association Rules. IEEE Transactions on Knowledge and Data Engineering, 9(5):8 3—825, October 1997.
 J. Pei and J. Han. Can We Push More Constraints into Frequent Pattern Mining? Proc. of 2000 Int. Conf. on Knowledge Discovery and Data Mining, August 2000.
 J. Pei, J. Han, and L.V.S. Lakshmanan. Mining Frequent Itemsets with Convertible Constraints. Proc. of the Intl. Conf. on Data Engineering, 2001.
 A. Savasere, E. Omiecinski, and S. Navathe. An Efficient Algorithm for Mining Association Rules in Large Databases. Proc. of the 21th International Conference on Very Large Data Bases, pages 432—444, September 1995.
 R. Srikant and R. Agrawal. Mining Generalized Association Rules. Proc. of the 21th International Conference on Very Large Data Bases, pages 407—49, September 1995.
 S. Thomas, S. Bodagala, K. Alsabti, and S. Ranka. An Efficient Algorithm for the Incremental Updating of Association Rules in Large Databases. Proc. of 1997 Intl. Conf. on Knowledge Discovery and Data Mining, 1997.
 H. Toivonen. Sampling Large Databases for Association Rules. Proc. of the 22th VLDB Conference,pages 34—1 45, September 1996.
 A.K.H. Tung, J. Han, L.V.S. Lakshmanan, and R. T. Ng. Constraint-Based Clustering in Large Databases. Proc. of 2001 Int. Conf. on Database Theory, January 2000.
 A. Veloso, B. Possas, W. Meira Jr., M. B. de Carvalho. Knowledge Management in Association Rule Mining, Integrating Data Mining and Knowledge Management, ICDM’’01: The 2001 IEEE International Conference on Data Mining, California, USA.  K. Wang,Y. He and J. Han. Mining Frequent Itemsets Using Support Constraints. Proc.of 2000 Int. Conf. on Very Large Data Bases, September 2000.
 M. J. Zaki, S. Parthasarathy and W. Li. New Algorithm for Fast Discovery of Association Rules. In Proc. Of the 3rd Intl. Con. On Knowledge Discovery and Data Mining, 1997.
 Zhou Zequn and C.I. Ezeife. A Low-Scan Incremental Association Rule Maintenance Method, Proceedings of the fourteenth Canadian Conference on Artificial Intelligence, AI 2001, holding June 7 to June 9, 2001, Ottawa, Canada.