![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
FIMI 2004: Brighton, UK
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.
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.