FIMI 2004: Brighton, UK

Roberto J. Bayardo Jr., Bart Goethals, Mohammed Javeed Zaki (Eds.): FIMI '04, Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations, Brighton, UK, November 1, 2004. CEUR Workshop Proceedings 126 CEUR-WS.org 2004

All datasets and sources of the implementations described in the accepted papers can be found on the FIMI repository: http: //fimi.cs.helsinki.fi/

Regular Papers

• Ferenc Bodon:
  Surprising Results of Trie-based FIM Algorithms.
  
• Frédéric Flouvat, Fabien De Marchi, Jean-Marc Petit:
  ABS: Adaptive Borders Search of frequent itemsets.
  
• Claudio Lucchese, Salvatore Orlando, Raffaele Perego:
  DCI Closed: A Fast and Memory Efficient Algorithm to Mine Frequent Closed Itemsets.
  
• Eray Özkural, Cevdet Aykanat:
  A Space Optimization for FP-Growth.
  
• Balázs Rácz:
  nonordfp: An FP-growth variation without rebuilding the FP-tree.
  
• Lars Schmidt-Thieme:
  Algorithmic Features of Eclat.
  
• Yudho Giri Sucahyo, Raj P. Gopalan:
  CT-PRO: A Bottom-Up Non Recursive Frequent Itemset Mining Algorithm Using Compressed FP-Tree Data Structure.
  
• Takeaki Uno, Masashi Kiyomi, Hiroki Arimura:
  LCM ver. 2: Efficient Mining Algorithms for Frequent/Closed/Maximal Itemsets.
  

Improved Implementations from FIMI'03

• Sagi Shporer:
  AIM2: Improved implementation of AIM.
  
• Jianfei Zhu, Gösta Grahne:
  Reducing the Main Memory Consumptions of FPmax* and FPclose.
  
• Claudio Lucchese, Salvatore Orlando, Raffaele Perego:
  kDCI: on using direct count up to the third iteration.
  
• Christian Borgelt:
  Recursion Pruning for the Apriori Algorithm.
  

Datasets

• Claudio Lucchese, Salvatore Orlando, Raffaele Perego, Fabrizio Silvestri:
  WebDocs: a real-life huge transactional dataset.