2005

Inbook (lakhal2005efficient)
Lakhal, L. & Stumme, G.
Ganter, B.; Stumme, G. & Wille, R. (ed.)
Efficient Mining of Association Rules Based on Formal Concept Analysis
Springer, 2005, 3626, 180-195

Article (pasquier2005generating)
Pasquier, N.; Taouil, R.; Bastide, Y.; Stumme, G. & Lakhal, L.
Generating a Condensed Representation for Association Rules
Journal Intelligent Information Systems (JIIS), Kluwer Academic Publishers, 2005, 24, 29-60

2002

Inproceedings (stumme02efficient)
Stumme, G.
Hameurlain, A.; Cicchetti, R. & Traunm├╝ller, R. (ed.)
Efficient Data Mining Based on Formal Concept Analysis
Springer, 2002, 2453, 534-546

2001

Inproceedings (stumme01intelligent)
Stumme, G.; Taouil, R.; Bastide, Y.; Pasquier, N. & Lakhal, L.
Baader, F.; Brewker, G. & Eiter, T. (ed.)
Intelligent Structuring and Reducing of Association Rules and with Formal Concept Analysis
Springer, 2001, 2174, 335-350

2000

Inproceedings (bastide00levelwise)
Bastide, Y.; Taouil, R.; Pasquier, N.; Stumme, G. & Lakhal, L.
Levelwise Search of Frequent Patterns
Blois, 2000, 307-322

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

Inproceedings (bastide00miningminimal)
Bastide, Y.; Pasquier, N.; Taouil, R.; Stumme, G. & Lakhal, L.
Lloyd, J.; Dahl, V.; Furbach, U.; Kerber, M.; Laus, K.-K.; Palamidessi, C.; Pereira, L.; Sagiv, Y. & Stuckey, P. (ed.)
Mining Minimal Non-Redundant Association Rules Using Frequent Closed Itemsets
Springer, 2000, 1861

Inproceedings (boulicaut00approximation)
Boulicaut, J.-F.; Bykowski, A. & Rigotti, C.
Approximation of Frequency Queris by Means of Free-Sets
2000, 75-85

1999

Techreport (stumme99conceptualknowledge)
Stumme, G.
Conceptual Knowledge Discovery with Frequent Concept Lattices
TU Darmstadt, 1999

1998

Inproceedings (pasquier98pruning)
Pasquier, N.; Bastide, Y.; Taouil, R. & Lakhal, L.
Bouzeghoub, M. (ed.)
Pruning closed itemset lattices for associations rules.
1998

Inproceedings (pasquier98pruning)
Pasquier, N.; Bastide, Y.; Taouil, R. & Lakhal, L.
Bouzeghoub, M. (ed.)
Pruning closed itemset lattices for associations rules.
1998