Inproceedings (Pasquier98)
Pasquier, N.; Bastide, Y.; Taouil, R. & Lakhal, L.
Pruning closed itemset lattices for association rules
1998, 177-196

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

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

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 (Taouil00b)
Taouil, R.; Pasquier, N.; Bastide, Y. & Lakhal, L.
Mining bases for association rules using Galois closed sets
IEEE Computer Society Press, 2000, 307

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

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

Inproceedings (Stum00fast)
Stumme, G.; Taouil, R.; Bastide, Y.; Pasquier, N. & Lakhal, L.
Fast computation of concept lattices using data mining techniques.
CEUR-Workshop Proceeding., 2000

Inproceedings (stumme00fast)
Stumme, G.; Taouil, R.; Bastide, Y.; Pasquier, N. & Lakhal, L.
Bouzeghoub, M.; Klusch, M.; Nutt, W. & Sattler, U. (ed.)
Fast Computation of Concept Lattices Using Data Mining Techniques
2000

Inproceedings (Pasquier00a)
Pasquier, N.
Extraction de bases pour les r�gles d'association � partir des itemsets
ferm�s fr�quents
2000

Article (Pasquier99c)
Pasquier, N.; Bastide, Y.; Taouil, R. & Lakhal, L.
Jarke, M. & Shasha, D. (ed.)
Efficient mining of association rules using closed itemset lattices
Information Systems, Elsevier Science, 1999, 24, 25-46

Inproceedings (Pasquier99b)
Pasquier, N.; Bastide, Y.; Taouil, R. & Lakhal, L.
Discovering frequent closed itemsets for association rules
Springer-Verlag, 1999, 398-416

Unpublished (Taouil99)
Taouil, R.; Pasquier, N.; Bastide, Y. & Lakhal, L.
Computing closed sets lattices : Algorithms, applications and performances
1999

Inproceedings (Pasquier99a)
Pasquier, N.; Bastide, Y.; Taouil, R. & Lakhal, L.
Closed set based discovery of small covers for association rules
1999, 361-381