| Discovering frequent closed itemsets for association rules N Pasquier, Y Bastide, R Taouil, L Lakhal International Conference on Database Theory, 398-416, 1999 | 2204 | 1999 |
| Efficient mining of association rules using closed itemset lattices N Pasquier, Y Bastide, R Taouil, L Lakhal Information systems 24 (1), 25-46, 1999 | 1209 | 1999 |
| Computing iceberg concept lattices with titanic G Stumme, R Taouil, Y Bastide, N Pasquier, L Lakhal Data & knowledge engineering 42 (2), 189-222, 2002 | 658 | 2002 |
| Mining minimal non-redundant association rules using frequent closed itemsets Y Bastide, N Pasquier, R Taouil, G Stumme, L Lakhal International Conference on Computational Logic, 972-986, 2000 | 522 | 2000 |
| Mining frequent patterns with counting inference Y Bastide, R Taouil, N Pasquier, G Stumme, L Lakhal ACM SIGKDD Explorations Newsletter 2 (2), 66-75, 2000 | 473 | 2000 |
| Generating a condensed representation for association rules N Pasquier, R Taouil, Y Bastide, G Stumme, L Lakhal Journal of intelligent information systems 24 (1), 29-60, 2005 | 259 | 2005 |
| Pruning closed itemset lattices for association rules N Pasquier, Y Bastide, R Taouil, L Lakhal BDA'1998 international conference on Advanced Databases, 177-196, 1998 | 154 | 1998 |
| Intelligent structuring and reducing of association rules with formal concept analysis G Stumme, R Taouil, Y Bastide, N Pasquier, L Lakhal Annual Conference on Artificial Intelligence, 335-350, 2001 | 145 | 2001 |
| Closed sets based discovery of small covers for association rules N Pasquier, Y Bastide, R Taouil, L Lakhal BDA'1999 international conference on Advanced Databases, 361-381, 1999 | 138 | 1999 |
| Fast Computation of Concept lattices Using Data Mining Techniques. G Stumme, R Taouil, Y Bastide, N Pasquier, L Lakhal KRDB 2, 129-139, 2000 | 129 | 2000 |
| Data mining: algorithmes d'extraction et de réduction des règles d'association dans les bases de données N Pasquier Université Blaise Pascal-Clermont-Ferrand II, 2000 | 107 | 2000 |
| Pascal: un algorithme d'extraction des motifs fréquents Y Bastide, R Taouil, N Pasquier, G Stumme, L Lakhal Revue des Sciences et Technologies de l'Information-Série TSI: Technique et …, 2002 | 83 | 2002 |
| GenMiner: mining non-redundant association rules from integrated gene expression data and annotations R Martinez, N Pasquier, C Pasquier Bioinformatics 24 (22), 2643-2644, 2008 | 80 | 2008 |
| Mining bases for association rules using closed sets R Taouil, N Pasquier, Y Bastide, L Lakhal ICDE'2000 International Conference, 307, 2000 | 69 | 2000 |
| Mining association rules using formal concept analysis N Pasquier ICCS'2000 International Conference on Conceptual Structures 1867, 259-264, 2000 | 49 | 2000 |
| A new approach for association rule mining and bi-clustering using formal concept analysis KC Mondal, N Pasquier, A Mukhopadhyay, U Maulik, S Bandhopadyay International Workshop on Machine Learning and Data Mining in Pattern …, 2012 | 42 | 2012 |
| GenMiner: mining informative association rules from genomic data R Martinez, C Pasquier, N Pasquier 2007 IEEE International Conference on Bioinformatics and Biomedicine (BIBM …, 2007 | 42 | 2007 |
| Semi-supervised consensus clustering based on closed patterns T Yang, N Pasquier, F Precioso Knowledge-Based Systems 235, 107599, 2022 | 32 | 2022 |
| Mining gene expression data using domain knowledge C Pasquier | 25 | 2008 |
| Extraction de Bases pour les Règles d'Association à partir des Itemsets Fermés Fréquents N Pasquier Inforsid'2000 Congress, 56-77, 2000 | 24 | 2000 |
Lotfi LAKHALFull Professor of Computer Science, Aix-Marseille UniversitéVerified email at univ-amu.fr
