1. Zaki M J. Efficiently mining frequent trees in a forest. In8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Copyright 2002 ACM 1-58113-567-X/02/0007, July 2002.
2. Cook D, Holder L. Substructure discovery using minimal description length and background knowledge.Journal of Artificial Intelligence Research, 1994, 1: 231–255.
3. Agrawal R, Mannila H, Srikant Ret al. Fast discovery of association rules. InAdvances in Knowledge Discovery and Data Mining, Fayyad Uet al. (eds.), AAAI Press, Menlo Park, CA, 1996, pp.307–328.
4. Cooley R, Mobasher B, Sravastava J. Web mining: Information and pattern discovering on the World Wide Web. In8th IEEE Int. Conf. Tools with AI, Newport Beach, California, USA, Nov. 1997, pp.558–567.
5. Zaki M J. SPADE: An efficient algorithm for mining frequent sequences.Machine Learning Journal, Jan/Feb 2001, 42(1/2): 112–120. Special issue on Unsupervised Learning.