Lakhal, L. & Stumme, G.
(2005).
Efficient Mining of Association Rules Based on Formal Concept Analysis.
In B. Ganter, G. Stumme & R. Wille (eds.),
Formal Concept Analysis: Foundations and Applications
(pp. 180-195).
Springer.
Lakhal, L. & Stumme, G.
(2005).
Efficient Mining of Association Rules Based on Formal Concept Analysis.
In B. Ganter, G. Stumme & R. Wille (eds.),
Formal Concept Analysis: Foundations and Applications
(pp. 180-195).
Springer.
Pasquier, N., Taouil, R., Bastide, Y., Stumme, G. & Lakhal, L.
(2005).
Generating a Condensed Representation for Association Rules. Journal Intelligent Information Systems (JIIS),
24, 29-60.
Pasquier, N., Taouil, R., Bastide, Y., Stumme, G. & Lakhal, L.
(2005).
Generating a Condensed Representation for Association Rules. Journal Intelligent Information Systems (JIIS),
24, 29-60.
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, 65-95.
Stumme, G.
(2002).
Efficient Data Mining Based on Formal Concept Analysis.
In A. Hameurlain, R. Cicchetti & R. Traunmüller (eds.),
Database and Expert Systems Applications. Proc. DEXA 2002 (p./pp. 534-546),
Heidelberg: Springer.
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 (eds.),
KI 2001: Advances in Artificial Intelligence. KI 2001 (p./pp. 335-350),
Heidelberg: Springer.
Bastide, Y., Taouil, R., Pasquier, N., Stumme, G. & Lakhal, L.
(2000).
Levelwise Search of Frequent Patterns.
Actes des 16ièmes Journées Bases de Données Avancées (p./pp. 307-322),
Oct 24-27,
France: Blois.
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, 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. Pereira, Y. Sagiv & P. Stuckey (eds.),
Computational Logic --- CL 2000 Proc. CL'00,
Heidelberg: Springer.
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 (eds.),
Proc. 7th Intl. Workshop on Knowledge Representation Meets Databases,
.
Stumme, G.
(1999).
Conceptual Knowledge Discovery with Frequent Concept Lattices
({FB}4-{P}reprint 2043).
TU Darmstadt
.