Lakhal, L. & Stumme, G. (2005): Efficient Mining of Association Rules Based on Formal Concept Analysis. LNAI Heidelberg
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

J
Pasquier, N.; Taouil, R.; Bastide, Y.; Stumme, G. & Lakhal, L. (2005): Generating a Condensed Representation for Association Rules. In: Journal Intelligent Information Systems (JIIS), Ausgabe/Number: 1, Vol. 24, Verlag/Publisher: Kluwer Academic Publishers. Erscheinungsjahr/Year: 2005. Seiten/Pages: 29-60. [Volltext] [BibTeX] [Endnote]

P
Stumme, G. (2002): Efficient Data Mining Based on Formal Concept Analysis. In: Database and Expert Systems Applications. Proc. DEXA 2002, Heidelberg. [Volltext]  [BibTeX][Endnote]

P
Stumme, G.; Taouil, R.; Bastide, Y.; Pasquier, N. & Lakhal, L. (2001): Intelligent Structuring and Reducing of Association Rules and with Formal Concept Analysis. In: KI 2001: Advances in Artificial Intelligence. KI 2001, Heidelberg. [Volltext]  [BibTeX][Endnote]

P
Bastide, Y.; Taouil, R.; Pasquier, N.; Stumme, G. & Lakhal, L. (2000): Levelwise Search of Frequent Patterns. In: Actes des 16ièmes Journées Bases de Données Avancées, France. [Volltext]  [BibTeX][Endnote]

J
Bastide, Y.; Taouil, R.; Pasquier, N.; Stumme, G. & Lakhal, L. (2000): Mining Frequent Patterns with Counting Inference.. In: SIGKDD Explorations, Special Issue on Scalable Algorithms, Ausgabe/Number: 2, Vol. 2, Erscheinungsjahr/Year: 2000. Seiten/Pages: 71-80. [BibTeX] [Endnote]

P
Bastide, Y.; Pasquier, N.; Taouil, R.; Stumme, G. & Lakhal, L. (2000): Mining Minimal Non-Redundant Association Rules Using Frequent Closed Itemsets. In: Computational Logic -- CL 2000 Proc. CL'00, Heidelberg. [Volltext]  [BibTeX][Endnote]

P
Boulicaut, J.-F.; Bykowski, A. & Rigotti, C. (2000): Approximation of Frequency Queris by Means of Free-Sets. In: Principles of Data Mining and Knowledge Discovery, [Volltext]  [BibTeX][Endnote]

Stumme, G. (1999): Conceptual Knowledge Discovery with Frequent Concept Lattices.
[Volltext] [BibTeX] [Endnote]

P
Pasquier, N.; Bastide, Y.; Taouil, R. & Lakhal, L. (1998): Pruning closed itemset lattices for associations rules.. In: Bases de Donn�es Avanc�es, [Volltext]  [BibTeX][Endnote]

P
Pasquier, N.; Bastide, Y.; Taouil, R. & Lakhal, L. (1998): Pruning closed itemset lattices for associations rules.. In: Bases de Données Avancées, [Volltext]  [BibTeX][Endnote]