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

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

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

Stumme, G. and Taouil, R. and Bastide, Y. and Pasqier, N. and Lakhal, L.. Computing Iceberg Concept Lattices with Titanic. In J. Data and KnowledgeEngineering (DKE), (42) 2: 189-222, Year 2002.

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

Stumme, G. and Taouil, R. and Bastide, Y. and Lakhal, L.. Conceptual Clustering with Iceberg Concept Lattices. Proc. GI-Fachgruppentreffen Maschinelles Lernen (FGML'01). editor(s) Klinkenberg, R. and Rüping, S. and Fick, A. and Henze, N. and Herzog, C. and Molitor, R. and Schröder, O.. Universität Dortmund 763, Year 2001.

Stumme, G. and Taouil, R. and Bastide, Y. and Lakhal, L.. Conceptual Clustering with Iceberg Concept Lattices. Proc. GI-Fachgruppentreffen Maschinelles Lernen (FGML'01). editor(s) Klinkenberg, R. and Rüping, S. and Fick, A. and Henze, N. and Herzog, C. and Molitor, R. and Schröder, O.. Universität Dortmund 763, Year 2001.

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

Bastide, Y. and Taouil, R. and Pasquier, N. and Stumme, G. and Lakhal, L.. Levelwise Search of Frequent Patterns. Actes des 16ièmes Journées Bases de Données Avancées. 307-322, Blois, France, 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.

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.

Boulicaut, Jean-Francois and Bykowski, Artur and Rigotti, Christophe. Approximation of Frequency Queris by Means of Free-Sets. Principles of Data Mining and Knowledge Discovery. 75-85, Year 2000.

Stumme, G. and Taouil, R. and Bastide, Y. and Pasquier, N. and Lakhal, L.. Fast Computation of Concept Lattices Using Data Mining Techniques. Proc. 7th Intl. Workshop on Knowledge Representation Meets Databases. editor(s) Bouzeghoub, M. and Klusch, M. and Nutt, W. and Sattler, U.. Year 2000.

Stumme, G.. Conceptual Knowledge Discovery with Frequent Concept Lattices. Year 1999.