• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 12 matches

• 2005
• 
  Nicolas 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
• 
  Gerd Stumme, Rafik Taouil, Yves Bastide, Nicolas Pasquier, Lotfi Lakhal:
  Computing iceberg concept lattices with T. Data Knowl. Eng. 42(2): 189-222 (2002)
• 2001
• 
  Gerd 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
• 
  Yves Bastide, Rafik Taouil, Nicolas Pasquier, Gerd Stumme, Lotfi Lakhal:
  Mining Frequent Patterns with Counting Inference. SIGKDD Explor. 2(2): 66-75 (2000)
• 
  Yves Bastide, Rafik Taouil, Nicolas Pasquier, Gerd Stumme, Lotfi Lakhal:
  Levelwise Search of Frequent Patterns with Counting Inference. BDA 2000
• 
  Yves Bastide, Nicolas Pasquier, Rafik Taouil, Gerd Stumme, Lotfi Lakhal:
  Mining Minimal Non-redundant Association Rules Using Frequent Closed Itemsets. Computational Logic 2000: 972-986
• 
  Rafik Taouil, Nicolas Pasquier, Yves Bastide, Lotfi Lakhal:
  Mining Bases for Association Rules Using Closed Sets. ICDE 2000: 307
• 
  Gerd Stumme, Rafik Taouil, Yves Bastide, Nicolas Pasquier, Lotfi Lakhal:
  Fast Computation of Concept lattices Using Data Mining Techniques. KRDB 2000: 129-139
• 1999
• 
  Nicolas Pasquier, Yves Bastide, Rafik Taouil, Lotfi Lakhal:
  Efficient Mining of Association Rules Using Closed Itemset Lattices. Inf. Syst. 24(1): 25-46 (1999)
• 
  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
• 
  Nicolas Pasquier, Yves Bastide, Rafik Taouil, Lotfi Lakhal:
  Discovering Frequent Closed Itemsets for Association Rules. ICDT 1999: 398-416
• 1998
• 
  Nicolas Pasquier, Yves Bastide, Rafik Taouil, Lotfi Lakhal:
  Pruning closed itemset lattices for associations rules. BDA 1998