dblp.uni-trier.dewww.uni-trier.de

Nicolas Pasquier

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo
Home Page

2008
17EERicardo Martínez, Nicolas Pasquier, Claude Pasquier: GenMiner: mining non-redundant association rules from integrated gene expression data and annotations. Bioinformatics 24(22): 2643-2644 (2008)
2007
16EERicardo Martínez, Claude Pasquier, Nicolas Pasquier: GenMiner: Mining Informative Association Rules from Genomic Data. BIBM 2007: 15-22
2006
15EERicardo Martínez, Nicolas Pasquier, Claude Pasquier, Lucero Lopez-Perez: Interpreting Microarray Experiments Via Co-expressed Gene Groups Analysis (CGGA). Discovery Science 2006: 316-320
14EERicardo Martínez, Nicolas Pasquier, Claude Pasquier, Martine Collard, Lucero Lopez-Perez: Co-expressed gene group analysis (CGGA): An automatic tool for the interpretation of microarray experiments. J. Integrative Bioinformatics 3(2): (2006)
2005
13EENicolas Pasquier, Rafik Taouil, Yves Bastide, Gerd Stumme, Lotfi Lakhal: Generating a Condensed Representation for Association Rules. J. Intell. Inf. Syst. 24(1): 29-60 (2005)
2002
12EEGerd Stumme, Rafik Taouil, Yves Bastide, Nicolas Pasquier, Lotfi Lakhal: Computing iceberg concept lattices with T. Data Knowl. Eng. 42(2): 189-222 (2002)
2001
11EEGerd Stumme, Rafik Taouil, Yves Bastide, Nicolas Pasquier, Lotfi Lakhal: Intelligent Structuring and Reducing of Association Rules with Formal Concept Analysis. KI/ÖGAI 2001: 335-350
2000
10 Yves Bastide, Rafik Taouil, Nicolas Pasquier, Gerd Stumme, Lotfi Lakhal: Levelwise Search of Frequent Patterns with Counting Inference. BDA 2000
9EEYves Bastide, Nicolas Pasquier, Rafik Taouil, Gerd Stumme, Lotfi Lakhal: Mining Minimal Non-redundant Association Rules Using Frequent Closed Itemsets. Computational Logic 2000: 972-986
8EERafik Taouil, Nicolas Pasquier, Yves Bastide, Lotfi Lakhal: Mining Bases for Association Rules Using Closed Sets. ICDE 2000: 307
7 Nicolas Pasquier: Extraction de bases pour les règles d'association à partir des itemsets fermés fréquents. INFORSID 2000: 56-77
6EEGerd Stumme, Rafik Taouil, Yves Bastide, Nicolas Pasquier, Lotfi Lakhal: Fast Computation of Concept lattices Using Data Mining Techniques. KRDB 2000: 129-139
5EEYves Bastide, Rafik Taouil, Nicolas Pasquier, Gerd Stumme, Lotfi Lakhal: Mining Frequent Patterns with Counting Inference. SIGKDD Explorations 2(2): 66-75 (2000)
1999
4EENicolas Pasquier, Yves Bastide, Rafik Taouil, Lotfi Lakhal: Discovering Frequent Closed Itemsets for Association Rules. ICDT 1999: 398-416
3 Nicolas Pasquier, Yves Bastide, Rafik Taouil, Lotfi Lakhal: Closed Set Based Discovery of Small Covers for Association Rules. Proc. 15èmes Journées Bases de Données Avancées, BDA 1999: 361-381
2EENicolas Pasquier, Yves Bastide, Rafik Taouil, Lotfi Lakhal: Efficient Mining of Association Rules Using Closed Itemset Lattices. Inf. Syst. 24(1): 25-46 (1999)
1998
1 Nicolas Pasquier, Yves Bastide, Rafik Taouil, Lotfi Lakhal: Pruning closed itemset lattices for associations rules. BDA 1998

Coauthor Index

1Yves Bastide [1] [2] [3] [4] [5] [6] [8] [9] [10] [11] [12] [13]
2Martine Collard [14]
3Lotfi Lakhal [1] [2] [3] [4] [5] [6] [8] [9] [10] [11] [12] [13]
4Lucero Lopez-Perez [14] [15]
5Ricardo Martínez [14] [15] [16] [17]
6Claude Pasquier [14] [15] [16] [17]
7Gerd Stumme [5] [6] [9] [10] [11] [12] [13]
8Rafik Taouil [1] [2] [3] [4] [5] [6] [8] [9] [10] [11] [12] [13]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)