Pascal: un alogorithme d'extraction des motifs fréquents.
Technique et Science Informatiques (TSI), 21(1):65-95, 2002.
Y. Bastide, R. Taouil, N. Pasquier, G. Stumme und L. Lakhal.
[doi]
[BibTeX]
Intelligent Structuring and Reducing of Association Rules and with Formal Concept Analysis.
In: F. Baader, G. Brewker und T. Eiter
(Herausgeber):
KI 2001: Advances in Artificial Intelligence. KI 2001, Band 2174, Reihe LNAI, Seiten 335-350.
Springer, Heidelberg, 2001.
G. Stumme, R. Taouil, Y. Bastide, N. Pasquier und L. Lakhal.
[doi]
[BibTeX]
Levelwise Search of Frequent Patterns.
In:
Actes des 16ièmes Journées Bases de Données Avancées, Seiten 307-322.
Blois, France, 2000.
Y. Bastide, R. Taouil, N. Pasquier, G. Stumme und L. Lakhal.
[doi]
[BibTeX]
Mining Frequent Patterns with Counting Inference..
SIGKDD Explorations, Special Issue on Scalable Algorithms, 2(2):71-80, 2000.
Y. Bastide, R. Taouil, N. Pasquier, G. Stumme und L. Lakhal.
[BibTeX]
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 und P. Stuckey
(Herausgeber):
Computational Logic -- CL 2000 Proc. CL'00, Band 1861, Reihe LNAI.
Springer, Heidelberg, 2000.
Y. Bastide, N. Pasquier, R. Taouil, G. Stumme und L. Lakhal.
[doi]
[BibTeX]
Extraction de bases pour les r�gles d'association � partir des itemsets ferm�s fr�quents.
In:
Actes du 18�me congr�s sur l'Informatique des Organisations et Syst�mes d'Information et de D�cision (INFORSID'2000).
2000.
N. Pasquier.
[BibTeX]
Fast Computation of Concept Lattices Using Data Mining Techniques.
In: M. Bouzeghoub, M. Klusch, W. Nutt und U. Sattler
(Herausgeber):
Proc. 7th Intl. Workshop on Knowledge Representation Meets Databases.
2000.
http://ceur-ws.org/Vol-29. Part of testumme02computing
G. Stumme, R. Taouil, Y. Bastide, N. Pasquier und L. Lakhal.
[doi]
[BibTeX]
Fast computation of concept lattices using data mining techniques..
In:
Proc. 7th Intl. Workshop on Knowledge Representation Meets Databases.
CEUR-Workshop Proceeding., Berlin, 2000.
http://sunsite.informatik.rwth-aachen.de/Publications/CEUR-WS/
G. Stumme, R. Taouil, Y. Bastide, N. Pasquier und L. Lakhal.
[BibTeX]
Mining bases for association rules using Galois closed sets.
In:
Proceedings of the 16th International Conference on Data Engineering (ICDE'2000), Seiten 307.
IEEE Computer Society Press, 2000.
R. Taouil, N. Pasquier, Y. Bastide und L. Lakhal.
[BibTeX]
Closed set based discovery of small covers for association rules.
In:
Actes des 15�mes journ�es Bases de Donn�es Avanc�es (BDA'99), Seiten 361-381.
1999.
N. Pasquier, Y. Bastide, R. Taouil und L. Lakhal.
[BibTeX]
Discovering frequent closed itemsets for association rules.
In:
Proceedings of the 7th biennial International Conference on Database Theory (ICDT'99), Reihe Lecture Notes in Computer Science, Vol. 1540, Seiten 398-416.
Springer-Verlag, 1999.
N. Pasquier, Y. Bastide, R. Taouil und L. Lakhal.
[BibTeX]
Efficient mining of association rules using closed itemset lattices.
Information Systems, 24(1):25-46, 1999.
N. Pasquier, Y. Bastide, R. Taouil und L. Lakhal.
[BibTeX]
Computing closed sets lattices : Algorithms, applications and performances.
1999. Rapport de recherche..
R. Taouil, N. Pasquier, Y. Bastide und L. Lakhal.
[BibTeX]
Pruning closed itemset lattices for association rules.
In:
Actes des 14�mes journ�es Bases de Donn�es Avanc�es (BDA'98), Seiten 177-196.
1998.
N. Pasquier, Y. Bastide, R. Taouil und L. Lakhal.
[BibTeX]