Bastide, Y. and Pasquier, N. and Taouil, R. and Stumme, G. and Lakhal, L.. Mining Minimal Non-Redundant Association Rules Using Frequent Closed Itemsets. Computational Logic --- CL 2000 Proc. CL'00. editor(s) Lloyd, J. and Dahl, V. and Furbach, U. and Kerber, M. and Laus, K.-K. and Palamidessi, C. and Pereira, L.M. and Sagiv, Y. and Stuckey, P.J.. LNAI, (1861) Springer, Heidelberg, Year 2000.
Bastide, Y. and Taouil, R. and Pasquier, N. and Stumme, G. and Lakhal, L.. Mining Frequent Patterns with Counting Inference.. In SIGKDD Explorations, Special Issue on Scalable Algorithms, (2) 2: 71-80, Year 2000.