Bastide, Y. ; Taouil, R. ; Pasquier, N. ; Stumme, G. ; Lakhal, L.:
Pascal: un alogorithme d'extraction des motifs fréquents.
In: Technique et Science Informatiques (TSI),
21
(2002),
Nr. 1,
S. 65-95
Stumme, G. ; Taouil, R. ; Bastide, Y. ; Pasquier, N. ; Lakhal, L.
; Baader, F. (Bearb.) ; Brewker, G. (Bearb.) ; Eiter, T. (Bearb.):
Intelligent Structuring and Reducing of Association Rules and with Formal Concept Analysis.
2174.
In: KI 2001: Advances in Artificial Intelligence. KI 2001.
Heidelberg
: Springer,
2001
(LNAI),
S. 335-350
Bastide, Y. ; Taouil, R. ; Pasquier, N. ; Stumme, G. ; Lakhal, L.:
Levelwise Search of Frequent Patterns.
In: Actes des 16ièmes Journées Bases de Données Avancées.
France
: Blois,
2000,
S. 307-322
Bastide, Y. ; Taouil, R. ; Pasquier, N. ; Stumme, G. ; Lakhal, L.:
Mining Frequent Patterns with Counting Inference..
In: SIGKDD Explorations, Special Issue on Scalable Algorithms,
2
(2000),
Nr. 2,
S. 71-80
Bastide, Y. ; Pasquier, N. ; Taouil, R. ; Stumme, G. ; Lakhal, L.
; Lloyd, J. (Bearb.) ; Dahl, V. (Bearb.) ; Furbach, U. (Bearb.) ; Kerber, M. (Bearb.) ; Laus, K.-K. (Bearb.) ; Palamidessi, C. (Bearb.) ; Pereira, L.M. (Bearb.) ; Sagiv, Y. (Bearb.) ; Stuckey, P.J. (Bearb.):
Mining Minimal Non-Redundant Association Rules Using Frequent Closed Itemsets.
1861.
In: Computational Logic --- CL 2000 Proc. CL'00.
Heidelberg
: Springer,
2000
(LNAI)
Pasquier, N.:
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
Stumme, G. ; Taouil, R. ; Bastide, Y. ; Pasquier, N. ; Lakhal, L.
; Bouzeghoub, M. (Bearb.) ; Klusch, M. (Bearb.) ; Nutt, W. (Bearb.) ; Sattler, U. (Bearb.):
Fast Computation of Concept Lattices Using Data Mining Techniques.
In: Proc. 7th Intl. Workshop on Knowledge Representation Meets Databases,
2000. -
\url{http://ceur-ws.org/Vol-29.} {P}art of \cite{stumme02computing}
Stumme, G. ; Taouil, R. ; Bastide, Y. ; Pasquier, N. ; Lakhal, L.:
Fast computation of concept lattices using data mining techniques..
In: Proc. 7th Intl. Workshop on Knowledge Representation Meets Databases.
Berlin
: CEUR-Workshop Proceeding.,
2000. -
{http://sunsite.informatik.rwth-aachen.de/Publications/CEUR-WS/}
Taouil, R. ; Pasquier, N. ; Bastide, Y. ; Lakhal, L.:
Mining bases for association rules using \textsc{G}alois closed sets.
In: Proceedings of the 16th International Conference on Data Engineering
(ICDE'2000)
: IEEE Computer Society Press,
2000,
S. 307
Pasquier, N. ; Bastide, Y. ; Taouil, R. ; Lakhal, L.:
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),
1999,
S. 361--381
Pasquier, N. ; Bastide, Y. ; Taouil, R. ; Lakhal, L.:
Discovering frequent closed itemsets for association rules.
In: Proceedings of the 7th biennial International Conference on Database
Theory (ICDT'99)
: Springer-Verlag,
1999
(Lecture Notes in Computer Science, Vol. 1540),
S. 398--416
Pasquier, N. ; Bastide, Y. ; Taouil, R. ; Lakhal, L.:
Efficient mining of association rules using closed itemset lattices.
In: Information Systems,
24
(1999),
Nr. 1,
S. 25--46
Taouil, R. ; Pasquier, N. ; Bastide, Y. ; Lakhal, L.:
Computing closed sets lattices : Algorithms, applications and performances,
1999. - Rapport de recherche.
Pasquier, N. ; Bastide, Y. ; Taouil, R. ; Lakhal, L.:
Pruning closed itemset lattices for association rules.
In: Actes des 14�mes journ�es Bases de Donn�es Avanc�es (BDA'98),
1998,
S. 177--196