1Agrawal 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, 1993, 207-216.
2Han J, Pei J, Yin Y. Mining frequent pattems without candidate generation [C]. Proc 2000 ACM-SIGMOD Int Conf Management of Data(SIGMOD' 00), Dalas, TX, 2000.
3Savasere 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,1995.
4Mannila H, Toivonen H, Verkamo A. Efficient algorithm for discovering association rules[C]. AAAI Workshop on Knowledge Discovery in Databases, 1994.181-192.
5Toivonen H. Sampling large databases for association rules[C].Bombay, India: Proceedings of the 22nd International Conference on Very Large Database, 1996.
6Brin S, Motwani R, Silverstein C. Beyond market baskets: Generlizing association rules to correlations[C]. Proceedings of the ACM SIGMOD, 1996. 255-276.
7Park J S, Chen M S, Yu P S. An effective hash-based algorithm for mining association rules[C]. San Jose, CA:Proceedings of ACM SIGMOD International Conference on Management of Data, 1995. 175-186.
8Ng R, Lakshmanan L V S, Han J. Exploratory mining and pruning optimizations of constrained associations rules[C]. Seattle,Washington: Proceedings ofACM SIGMOD International Conference on Management of Data, 1998.13-24.
