• 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 16 matches

• 2003
• 
  Ferenc Bodon:
  A fast APRIORI implementation. FIMI 2003
• 
  Douglas Burdick, Manuel Calimlim, Jason Flannick, Johannes Gehrke, Tomi Yiu:
  MAFIA: A Performance Study of Mining Maximal Frequent Itemsets. FIMI 2003
• 
  Amos Fiat, Sagi Shporer:
  AIM: Another Itemset Miner. FIMI 2003
• 
  Bart Goethals, Mohammed Javeed Zaki:
  Advances in Frequent Itemset Mining Implementations: Introduction to FIMI03. FIMI 2003
• 
  Gösta Grahne, Jianfei Zhu:
  Efficiently Using Prefix-trees in Mining Frequent Itemsets. FIMI 2003
• 
  Attila Gyenesei, Jukka Teuhola:
  Probabilistic Iterative Expansion of Candidates in Mining Frequent Itemsets. FIMI 2003
• 
  Walter A. Kosters, Wim Pijls:
  Apriori, A Depth First Implementation. FIMI 2003
• 
  Guimei Liu, Hongjun Lu, Jeffrey Xu Yu, Wei Wang, Xiangye Xiao:
  AFOPT: An Efficient Implementation of Pattern Growth Approach. FIMI 2003
• 
  Taneli Mielikäinen:
  Intersecting data to closed sets with constraints. FIMI 2003
• 
  Salvatore Orlando, Claudio Lucchese, Paolo Palmerini, Raffaele Perego, Fabrizio Silvestri:
  kDCI: a Multi-Strategy Algorithm for Mining Frequent Sets. FIMI 2003
• 
  Andrea Pietracaprina, Dario Zandolin:
  Mining Frequent Itemsets using Patricia Tries. FIMI 2003
• 
  Vikram Pudi, Jayant R. Haritsa:
  ARMOR: Association Rule Mining based on ORacle. FIMI 2003
• 
  Takeaki Uno, Tatsuya Asai, Yuzo Uchida, Hiroki Arimura:
  LCM: An Efficient Algorithm for Enumerating Frequent Closed Item Sets. FIMI 2003
• 
  Takeaki Uno, Ken Satoh:
  Detailed Description of an Algorithm for Enumeration of Maximal Frequent Sets with Irredundant Dualization. FIMI 2003
• 
  Osmar R. Zaïane, Mohammad El-Hajj:
  COFI-tree Mining: A New Approach to Pattern Growth with Reduced Candidacy Generation. FIMI 2003
• 
  Bart Goethals, Mohammed Javeed Zaki:
  FIMI '03, Frequent Itemset Mining Implementations, Proceedings of the ICDM 2003 Workshop on Frequent Itemset Mining Implementations, 19 December 2003, Melbourne, Florida, USA. CEUR Workshop Proceedings 90, CEUR-WS.org 2003 [contents]