QuickSearch:   Number of matching entries: 0.

AuthorTitleYearJournal/ProceedingsReftypeDOI/URL
Pasquier, N., Bastide, Y., Taouil, R. & Lakhal, L. Pruning closed itemset lattices for association rules 1998 Actes des 14�mes journ�es Bases de Donn�es Avanc�es (BDA'98)   inproceedings  
Bastide, Y., Taouil, R., Pasquier, N., Stumme, G. & Lakhal, L. Pascal: un alogorithme d'extraction des motifs fréquents 2002 Technique et Science Informatiques (TSI)   article URL  
Bastide, Y., Pasquier, N., Taouil, R., Stumme, G. & Lakhal, L. Mining Minimal Non-Redundant Association Rules Using Frequent Closed Itemsets 2000 Computational Logic --- CL 2000 Proc. CL'00 Lloyd, J.; Dahl, V.; Furbach, U.; Kerber, M.; Laus, K.-K.; Palamidessi, C.; Pereira, L.; Sagiv, Y. & Stuckey, P. (ed.)
 
inproceedings URL  
Bastide, Y., Taouil, R., Pasquier, N., Stumme, G. & Lakhal, L. Mining Frequent Patterns with Counting Inference. 2000 SIGKDD Explorations, Special Issue on Scalable Algorithms   article  
Taouil, R., Pasquier, N., Bastide, Y. & Lakhal, L. Mining bases for association rules using Galois closed sets 2000 Proceedings of the 16th International Conference on Data Engineering
(ICDE'2000)  
inproceedings  
Bastide, Y., Taouil, R., Pasquier, N., Stumme, G. & Lakhal, L. Levelwise Search of Frequent Patterns 2000 Actes des 16ièmes Journées Bases de Données Avancées   inproceedings URL  
Stumme, G., Taouil, R., Bastide, Y., Pasquier, N. & Lakhal, L. Intelligent Structuring and Reducing of Association Rules and with Formal Concept Analysis 2001 KI 2001: Advances in Artificial Intelligence. KI 2001 Baader, F.; Brewker, G. & Eiter, T. (ed.)
 
inproceedings URL  
Stumme, G., Taouil, R., Bastide, Y., Pasquier, N. & Lakhal, L. Fast computation of concept lattices using data mining techniques. 2000 Proc. 7th Intl. Workshop on Knowledge Representation Meets Databases   inproceedings  
Stumme, G., Taouil, R., Bastide, Y., Pasquier, N. & Lakhal, L. Fast Computation of Concept Lattices Using Data Mining Techniques 2000 Proc. 7th Intl. Workshop on Knowledge Representation Meets Databases Bouzeghoub, M.; Klusch, M.; Nutt, W. & Sattler, U. (ed.)
 
inproceedings URL  
Pasquier, N. Extraction de bases pour les r�gles d'association � partir des itemsets ferm�s fr�quents 2000 Actes du 18�me congr�s sur l'Informatique des Organisations et Syst�mes
d'Information et de D�cision (INFORSID'2000)  
inproceedings  
Pasquier, N., Bastide, Y., Taouil, R. & Lakhal, L. Efficient mining of association rules using closed itemset lattices 1999 Information Systems Jarke, M. & Shasha, D. (ed.)
 
article  
Pasquier, N., Bastide, Y., Taouil, R. & Lakhal, L. Discovering frequent closed itemsets for association rules 1999 Proceedings of the 7th biennial International Conference on Database
Theory (ICDT'99)  
inproceedings  
Taouil, R., Pasquier, N., Bastide, Y. & Lakhal, L. Computing closed sets lattices : Algorithms, applications and performances 1999   unpublished  
Pasquier, N., Bastide, Y., Taouil, R. & Lakhal, L. Closed set based discovery of small covers for association rules 1999 Actes des 15�mes journ�es Bases de Donn�es Avanc�es (BDA'99)   inproceedings  

Created by JabRef export filters on 03/05/2024 by the social publication management platform PUMA