Mining Minimal Non-Redundant Association Rules Using Frequent Closed Itemsets.
In: J. Lloyd, V. Dahl, U. Furbach, M. Kerber, K.-K. Laus, C. Palamidessi, L. Pereira, Y. Sagiv und P. Stuckey (Herausgeber): Computational Logic -- CL 2000 Proc. CL'00, Band 1861, Reihe LNAI. Springer, Heidelberg, 2000.
Y. Bastide, N. Pasquier, R. Taouil, G. Stumme und L. Lakhal.
[doi]  [BibTeX] 

Mining Frequent Patterns with Counting Inference..
SIGKDD Explorations, Special Issue on Scalable Algorithms, 2(2):71-80, 2000.
Y. Bastide, R. Taouil, N. Pasquier, G. Stumme und L. Lakhal.
[BibTeX]