Nicolas Pasquier

Algorithms & Complexity · 2000–2002

A researcher in the Science corpus: 3 papers; trusts 2 researchers and is trusted by 7 researchers here, as inferred from the citation graph.

Subfields

• Algorithms & Complexity — 7 citations into it

Whom Nicolas Pasquier trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Rakesh Agrawal
2. Roberto J. Bayardo Jr.

Who trusts Nicolas Pasquier overall

1. Aaron Ceglar
2. Christian Borgelt
3. Liqiang Geng
4. Mohammed J. Zaki
5. John F. Roddick

Papers from Nicolas Pasquier's perspective

Ordered by how strongly the researchers Nicolas Pasquier trusts endorse each paper. Same corpus, a different order for every researcher.

1. Efficiently mining long patterns from databases
2. Fast Algorithms for Mining Association Rules
3. Data Mining - Concepts and Techniques (Künstliche Intell.)
4. Mining association rules between sets of items in large databases
5. Data Mining: Concepts and Techniques
6. Mining frequent patterns without candidate generation
7. Mining frequent patterns with counting inference (SKDD)
8. The Nature of Statistical Learning Theory
9. Fast Discovery of Association Rules
10. Rule Induction with CN2: Some Recent Improvements

Their papers

• Mining frequent patterns with counting inference (2000) — 360 citations
• Computing iceberg concept lattices with T (2002) — 518 citations
• Mining Minimal Non-redundant Association Rules Using Frequent Closed Itemsets (2000) — 387 citations