2005

Generating a Condensed Representation for Association Rules.
Journal Intelligent Information Systems (JIIS), 24(1):29-60, 2005.
Nicolas Pasquier, Rafik Taouil, Yves Bastide, Gerd Stumme and Lotfi Lakhal.
[doi]  [BibTeX] 

2000

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 and L. Lakhal.
[BibTeX] 
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 and P. Stuckey, editors, Computational Logic -- CL 2000 Proc. CL'00, volume 1861, series LNAI. Springer, Heidelberg, 2000.
Y. Bastide, N. Pasquier, R. Taouil, G. Stumme and L. Lakhal.
[doi]  [BibTeX] 

1999

Conceptual Knowledge Discovery with Frequent Concept Lattices.
FB4-Preprint 2043, TU Darmstadt, 1999.
G. Stumme.
[doi]  [BibTeX]