[Lakhal and Stumme 2005] Lakhal, L. and Stumme, G.: "Efficient Mining of Association Rules Based on Formal Concept Analysis" Ganter, B., Stumme, G. and Wille, R., eds.; Formal Concept Analysis: Foundations and Applications, Springer, Heidelberg (2005), 180-195.

[Lakhal and Stumme 2005] Lakhal, L. and Stumme, G.: "Efficient Mining of Association Rules Based on Formal Concept Analysis" Ganter, B., Stumme, G. and Wille, R., eds.; Formal Concept Analysis: Foundations and Applications, Springer, Heidelberg (2005), 180-195.

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

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

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

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

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

[Stumme et al. 2001] Stumme, G., Taouil, R., Bastide, Y., Pasquier, N. and Lakhal, L.: "Intelligent Structuring and Reducing of Association Rules and with Formal Concept Analysis" Baader, F., Brewker, G. and Eiter, T., eds.; KI 2001: Advances in Artificial Intelligence. KI 2001, Springer, Heidelberg (2001), 335-350.

[Bastide et al. 2000] Bastide, Y., Taouil, R., Pasquier, N., Stumme, G. and Lakhal, L.: "Levelwise Search of Frequent Patterns"; Actes des 16ièmes Journées Bases de Données Avancées, Blois, France (2000), 307-322.

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

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

[Boulicaut et al. 2000] Boulicaut, J.-F., Bykowski, A. and Rigotti, C.: "Approximation of Frequency Queris by Means of Free-Sets"; Principles of Data Mining and Knowledge Discovery (2000), 75-85.

[Stumme et al. 2000] Stumme, G., Taouil, R., Bastide, Y., Pasquier, N. and Lakhal, L.: "Fast Computation of Concept Lattices Using Data Mining Techniques" Bouzeghoub, M., Klusch, M., Nutt, W. and Sattler, U., eds.; Proc. 7th Intl. Workshop on Knowledge Representation Meets Databases, http://ceur-ws.org/Vol-29. Part of stumme02computing (2000).

[Stumme 1999] Stumme, G.: "Conceptual Knowledge Discovery with Frequent Concept Lattices", TU Darmstadt (1999).