Lakhal, L. & Stumme, G. (2005), Efficient Mining of Association Rules Based on Formal Concept Analysis, Springer, Heidelberg, pp. 180-195.

Lakhal, L. & Stumme, G. (2005), Efficient Mining of Association Rules Based on Formal Concept Analysis, Springer, Heidelberg, pp. 180-195.

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

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

Stumme, G. (2002), Efficient Data Mining Based on Formal Concept Analysis, in A. Hameurlain; R. Cicchetti & R. Traunmüller, ed.,'Database and Expert Systems Applications. Proc. DEXA 2002', Springer, Heidelberg, pp. 534-546.

Stumme, G.; Taouil, R.; Bastide, Y. & Lakhal, L. (2001), Conceptual  Clustering  with  Iceberg  Concept Lattices, in R. Klinkenberg; S. Rüping; A. Fick; N. Henze; C. Herzog; R. Molitor & O. Schröder, ed.,'Proc. GI-Fachgruppentreffen Maschinelles Lernen (FGML'01)'.

Stumme, G.; Taouil, R.; Bastide, Y. & Lakhal, L. (2001), Conceptual Clustering with Iceberg Concept Lattices, in R. Klinkenberg; S. Rüping; A. Fick; N. Henze; C. Herzog; R. Molitor & O. Schröder, ed.,'Proc. GI-Fachgruppentreffen Maschinelles Lernen (FGML'01)'.

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

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', Blois, France, pp. 307-322.

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

Bastide, Y.; Pasquier, N.; Taouil, R.; Stumme, G. & Lakhal, L. (2000), 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.M. Pereira; Y. Sagiv & P.J. Stuckey, ed.,'Computational Logic --- CL 2000 Proc. CL'00', Springer, Heidelberg.

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', pp. 75-85.

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

Stumme, G. (1999),'Conceptual Knowledge Discovery with Frequent Concept Lattices', Technical report, TU Darmstadt.