Jean-François Boulicaut

Computational Theory and Mathematics · 2004–2016

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

Subfields

Whom Jean-François Boulicaut trusts overall

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

  1. Rakesh Agrawal
  2. Mohammed J. Zaki
  3. Roberto J. Bayardo Jr.
  4. Douglas Burdick
  5. Rayadurgam Srikant
  6. Manuel Calimlim
  7. Artur Bykowski
  8. Heikki Mannila
  9. Tomasz Imielinski
  10. Toon Calders

Who trusts Jean-François Boulicaut overall

  1. Longbing Cao
  2. Chengqi Zhang
  3. Siegfried Nijssen
  4. Baptiste Jeudy
  5. Bart Goethals
  6. Aaron Ceglar
  7. Élisa Fromont

Papers from Jean-François Boulicaut's perspective

Ordered by how strongly the researchers Jean-François Boulicaut trusts endorse each paper. Same corpus, a different order for every researcher.

  1. Efficiently mining long patterns from databases
  2. Fast Discovery of Association Rules
  3. Mining association rules between sets of items in large databases
  4. MAFIA: a maximal frequent itemset algorithm for transactional databases (Proceedings / International Conference on Data Engineering)
  5. Fast Algorithms for Mining Association Rules in Large Databases
  6. The Nature of Statistical Learning Theory
  7. Mining All Non-derivable Frequent Itemsets (European Conference on Principles of Data Mining and Knowledge Discovery)
  8. Free-Sets: A Condensed Representation of Boolean Data for the Approximation of Frequency Queries (Data mining and knowledge discovery)
  9. Sequence mining in categorical domains: incorporating constraints (International Conference on Information and Knowledge Management)
  10. Efficient algorithms for mining closed itemsets and their lattice structure (IEEE Transactions on Knowledge and Data Engineering)

Their papers