Lakhal, Lotfi ; Stumme, Gerd ; Ganter, Bernhard (Bearb.) ; Stumme, Gerd (Bearb.) ; Wille, Rudolf (Bearb.): Efficient Mining of Association Rules Based on Formal Concept Analysis In: Formal Concept Analysis: Foundations and Applications. 3626. Heidelberg : Springer, 2005 (LNAI), S. 180-195

Pasquier, Nicolas ; Taouil, Rafik ; Bastide, Yves ; Stumme, Gerd ; Lakhal, Lotfi: Generating a Condensed Representation for Association Rules. In: Journal Intelligent Information Systems (JIIS), 24 (2005), Nr. 1, S. 29-60

Bastide, Y. ; Taouil, R. ; Pasquier, N. ; Stumme, G. ; Lakhal, L.: Pascal: un alogorithme d'extraction des motifs fréquents. In: Technique et Science Informatiques (TSI), 21 (2002), Nr. 1, S. 65-95

Stumme, G. ; Hameurlain, A. (Bearb.) ; Cicchetti, R. (Bearb.) ; Traunmüller, R. (Bearb.): Efficient Data Mining Based on Formal Concept Analysis. 2453. In: Database and Expert Systems Applications. Proc. DEXA 2002. Heidelberg : Springer, 2002 (LNCS), S. 534-546

Stumme, G. ; Taouil, R. ; Bastide, Y. ; Pasquier, N. ; Lakhal, L. ; Baader, F. (Bearb.) ; Brewker, G. (Bearb.) ; Eiter, T. (Bearb.): Intelligent Structuring and Reducing of Association Rules and with Formal Concept Analysis. 2174. In: KI 2001: Advances in Artificial Intelligence. KI 2001. Heidelberg : Springer, 2001 (LNAI), S. 335-350

Bastide, Y. ; Taouil, R. ; Pasquier, N. ; Stumme, G. ; Lakhal, L.: Levelwise Search of Frequent Patterns. In: Actes des 16ièmes Journées Bases de Données Avancées. France : Blois, 2000, S. 307-322

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

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

Stumme, G. ; TU Darmstadt (Hrsg.): Conceptual Knowledge Discovery with Frequent Concept Lattices, 1999

Pasquier, Nicolas ; Bastide, Yves ; Taouil, Rafik ; Lakhal, Lotfi ; Bouzeghoub, Mokrane (Bearb.): Pruning closed itemset lattices for associations rules.. In: Bases de Donn�es Avanc�es, 1998

Pasquier, Nicolas ; Bastide, Yves ; Taouil, Rafik ; Lakhal, Lotfi ; Bouzeghoub, Mokrane (Bearb.): Pruning closed itemset lattices for associations rules.. In: Bases de Données Avancées, 1998