1. 1. Pasquier N, Bastide Y, Taouil R and Lakhal, ―Pruning Closed Itemset Lattices for Association Rules‖, Proc. BDA conf., pp 177-196, 1998.
   2.  Pasquier N, Bastide Y, Taouil R and Lakhal L, ―Efficient Mining of Association Rules using Closed Itemset Lattices‖, Information Systems, vol 24, No 1, pp 25-46,1999.
   3.  Pasquier N, Bastide Y, Taouil R and Lakhal, ― Discovering frequent closed itemsets for association rules‖, In: Proc 7th Int Conf on Database Theory (ICDT’99), Jerusalem, Israel, pp 398–416,1999.
   4.  Zaki M, ―Generating non-redundant association rules‖, In: Proc 2000 ACM SIGKDD Int Conf Knowledge Discovery in Database(KDD’00), Boston, USA, pp 34–43, 2000.
   5. J. Pei, J. Han, and R. Mao, ―CLOSET: An efficient algorithm for mining frequent closed itemsets‖,In ACM SIGMOD’00 Workshop on Research Issues in Data Mining and Knowledge Discovery, pp 21–30, 2000.
   6.  J. Wang, J. Han and J. Pei, ―Closet+: Searching for the best strategies for mining frequent closed itemsets,‖ in Proc. KDD, New York, NY, USA, pp. 236–245, 2003. [
   7. Ng R, Lakshmanan LVS, Han J and Pang A, ―Exploratory mining and pruning optimizations of constrained associations rules‖, In: Proc 1998 ACMSIGMOD Int Conf Management of Data(SIGMOD’98), Seattle, USA, pp 13–24, 1998.