Pasquier, N.; Bastide, Y.; Taouil, R. & Lakhal, L. (1998),
Pruning closed itemset lattices for association rules, in
'Actes des 14�mes journ�es Bases de Donn�es Avanc�es (BDA'98)'
, pp. 177--196
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
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
(1)
, 65-95
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
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.M. Pereira; Y. Sagiv & P.J. Stuckey, ed.,
'Computational Logic --- CL 2000 Proc. CL'00'
, Springer, Heidelberg
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
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
(2)
, 71-80
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Taouil, R.; Pasquier, N.; Bastide, Y. & Lakhal, L. (2000),
Mining bases for association rules using Galois closed sets, in
'Proceedings of the 16th International Conference on Data Engineering
(ICDE'2000)'
, IEEE Computer Society Press,
, pp. 307
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Bastide, Y.; Taouil, R.; Pasquier, N.; Stumme, G. & Lakhal, L. (2000),
Levelwise Search of Frequent Patterns, in
'Actes des 16ièmes Journées Bases de Données Avancées'
, Blois, France
, pp. 307-322
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
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, ed.,
'KI 2001: Advances in Artificial Intelligence. KI 2001'
, Springer, Heidelberg
, pp. 335-350
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Stumme, G.; Taouil, R.; Bastide, Y.; Pasquier, N. & Lakhal, L. (2000),
Fast computation of concept lattices using data mining techniques., in
'Proc. 7th Intl. Workshop on Knowledge Representation Meets Databases'
, CEUR-Workshop Proceeding., Berlin
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
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, ed.,
'Proc. 7th Intl. Workshop on Knowledge Representation Meets Databases'
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Pasquier, N. (2000),
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)'
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Pasquier, N.; Bastide, Y.; Taouil, R. & Lakhal, L. (1999),
'Efficient mining of association rules using closed itemset lattices', Information Systems
24
(1)
, 25--46
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Pasquier, N.; Bastide, Y.; Taouil, R. & Lakhal, L. (1999),
Discovering frequent closed itemsets for association rules, in
'Proceedings of the 7th biennial International Conference on Database
Theory (ICDT'99)'
, Springer-Verlag,
, pp. 398--416
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Taouil, R.; Pasquier, N.; Bastide, Y. & Lakhal, L. (1999),
'Computing closed sets lattices : Algorithms, applications and performances'
, Rapport de recherche.
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Pasquier, N.; Bastide, Y.; Taouil, R. & Lakhal, L. (1999),
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)'
, pp. 361--381
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]