|| An Chen and Huilin Ye. 2004. Multiple-Level Sequential Pattern Discovery from Customer Transaction Database. In International Journal of Computation Intelligence Volume 1 Number 1 2004.|
 Anthony K. H. Tung, H. Lu, J. Han and L. Feng. 2003. Efficient Mining of Intertransaction Association Rules. In IEEE Transactions on knowledge and data engineering, vol.15, no.1, January/February 2003.
 B. Liu, W. Hsu and Y. Ma. 1999. Mining Association Rule with Multiple Minimum supports. In Proc. 1999 ACM SIGMOD Int¡¦l Conf. on Management of Data, San Diego, CA, USA.
 B. Liu, W. Hsu and Y. Ma. 1999. Pruning and Summarizing the Discovered Associations. In S Surajit Chaudhuri abd David Madigan, editors, Proceedings of Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, page 125-134, N.Y., August 15-18 1999. ACM Press.
 D. Shah, L. V.S. Lakshmanan, K. Ramamritham and S. Sudarshan. 1999. Interestingness and Pruning of Mined Patterns. Indian Institute of Technology, Bombay.
 H. Lu, L. Feng, J. Han. 2000. Beyond Intratransaction Association Analysis: Mining Multidimensional Intertransaction Association Rules. In ACM Transactions on Information Systems, Vol. 18, No. 4, October 2000, pp. 423-454.
 I. Pramudiono and M. Kitsuregawa. 2004. FP-tax: Tree Structure based generalized association rule mining. In Proceeding of the 9th ACM SIGMO Workshop on Research Issues in Data Mining and Knowledge Discovery, June 2004.
 J. Deogun and L. Jiang. 2005. Prediction Mining ¡V An Approach to Mining
Association Rules for Prediction. In Rough Sets, Fuzzy Sets, Data Mining, and
Granular Computing: 10th International Conference, RSFDGrC 2005, Regina,
Canada, August 31 - September 3, 2005, Proceedings, Part II.
 J. Han, Y. Fu. 1995. Discovery of Multiple-Level Association Rules from Large
Databases. in Proc. of the 21st VLDB Conf., Zurich, Switzerland.
 J. Han. 1995. Mining Knowledge at Multiple Concept Levels. In School of
Computer Science Simon Fraser University Brutish Columbia, Canada V5A 1S6.
 J. Han, J. Pei, and Y. Yin. 2000. Mining frequent patterns without candidate generation. In Proceeding of the ACM SIGMOD International Conference on Management of Data (SIGMOD¡¦00), 2000.
 J. Han, M. Kamber 2001. Data Mining: Concepts and Techniques. In Morgan
 J. M. de Graaf, W.A. Kosters, J. J.W. Witteman. 2000. Interesting Association
Rules in Multiple Taxonomies. In Leiden Institute of Advanced Computer Science Universiteit Leiden.
 K.-L Ong, W.-K Ng and E.-P. Lim. 2001. Mining Multi-Level Rules with Recurrent Items Using FP¡¦-Tree. In Proc. Of the 3rd Int. Conf. on Information, Communications and Signal Processing, Singapore, Oct. 2001.
 M. J. Zaki. 2000. Generating Non-Redundant Association Rules. Computer
Science Department Rensselaer Polytechnic Institute, Troy NY 12180.
 Q. Zhao and S.S. Bhowmick. 2003. Association Rule Mining: A Survey. In Technical Report, CAIS, Nanyang Technological University Singapore, No. 2003116, 2003
 R. Agrawal, T. Imielinski, A. Swami. 1993. Mining Association Rules Between Sets of Items in Large Databases. In Proc. 1993 ACM SIGMOD Int¡¦l Conf. on Management of Data, Washington, D.C. pp.207-216.
 R. Agrawal, H. Mannila, R. Shikant, H. Toivonen. A.I. Verkamo. 1996. Fast Discovery of Association Rules. In Advance in Knowledge Discovery and Data Minng. pp.307-328.
 R. Srikant and R. Agrawal. 1995. Mining Generalized association rules. Research Report RJ 9963, IBM Almaden Research Center, San Jose, California, June 1995.
 R. Srikant and R. Agrawal. 1995. Mining Sequential Patterns, In Proceedings of the 11th International Conference on Data Engineering ( ICDE¡¦95), 1995, pp.3-14.
 R. J. Bayardo and R. Agrawal. 1999. Mining the Most Interesting Rules. In Proc. of the 5th ACM SIGDD International Conference on Knowledge Discovery and Data Mining, page 145-154, August 1999.
 R. Hilderman and H. Hamilton. 1999. Knowledge Discovery and Interestingness Measure: A Survey. Technique Report CS 99-04, Department of Computer Science, University of Regina, 1999.
 S. Jaroszewicz and D. A. Simovici. 2001. A General Measure of rule Interestingness. In Proc. Of PKDD 2001, Freiburg, Germany, volume 2168 of Lecture Notes in Computer Science, page 253-265. Springer, September 2001.
 S. Luhr, G. West and S. Vankatesh. 2005. An Extended Frequent Pattern Tree for Intertransation Association Rule Mining. In Technical Report 2005/1, Department of Computing, Curtin University of Technology, 2005.
 Y. Bastide, N. Oasquier, R. Taouil, G. Stumme and L. Lahal. 2000. Mining
Minimal Non-Redundant Association Rules using Frequent Closed Itemsets. In
Proceedings of the 1st International Conference on CL (6th International Conference on Database System). In J. Lloyd, V. Dahl, U. Furbach, M. Kerber, K.-K. Lau, C. Palamidessi, L.M. Pereira, Y. Sagiv, P.J. Stuckey (Eds.), Computational Logic-CL, LNAL 1861, Springer, Heidelberg, 2000.
 Y. H. Hu and Y.L. Chen. 2003. Discovering and Maintaining Association Rules with Multiple Minimum Supports. Department of Information Management, National Central University Chung-Li 320, Taiwan, R.O.C.