Abstract is missing.
- A Space Optimization for FP-GrowthEray Özkural, Cevdet Aykanat. [doi]
- ABS: Adaptive Borders Search of frequent itemsetsFrédéric Flouvat, Fabien De Marchi, Jean-Marc Petit. [doi]
- AIM2: Improved implementation of AIMSagi Shporer. [doi]
- kDCI: on using direct count up to the third iterationClaudio Lucchese, Salvatore Orlando, Raffaele Perego. [doi]
- Surprising Results of Trie-based FIM AlgorithmsFerenc Bodon. [doi]
- LCM ver. 2: Efficient Mining Algorithms for Frequent/Closed/Maximal ItemsetsTakeaki Uno, Masashi Kiyomi, Hiroki Arimura. [doi]
- Algorithmic Features of EclatLars Schmidt-Thieme. [doi]
- DCI Closed: A Fast and Memory Efficient Algorithm to Mine Frequent Closed ItemsetsClaudio Lucchese, Salvatore Orlando, Raffaele Perego. [doi]
- CT-PRO: A Bottom-Up Non Recursive Frequent Itemset Mining Algorithm Using Compressed FP-Tree Data StructureYudho Giri Sucahyo, Raj P. Gopalan. [doi]
- nonordfp: An FP-growth variation without rebuilding the FP-treeBalázs Rácz. [doi]
- Reducing the Main Memory Consumptions of FPmax* and FPcloseJianfei Zhu, Gösta Grahne. [doi]
- Recursion Pruning for the Apriori AlgorithmChristian Borgelt. [doi]
- WebDocs: a real-life huge transactional datasetClaudio Lucchese, Salvatore Orlando, Raffaele Perego, Fabrizio Silvestri. [doi]