GrAFCI+ A fast generator-based algorithm for mining frequent closed itemsets
Authors:
- 18 May 2021
- journal article
- research article
- Published by Springer Nature in Knowledge and Information Systems
- Vol. 63 (7) , 1873-1908
Abstract
No abstract availableKeywords
This publication has 29 references indexed in Scilit:
- A new framework for metaheuristic-based frequent itemset miningApplied Intelligence, 2018
- The SPMF Open-Source Data Mining Library Version 22016
- PrePost+: An efficient N-lists-based algorithm for mining frequent itemsets via Children–Parent Equivalence pruningExpert Systems with Applications, 2015
- A new algorithm for fast mining frequent itemsets using N-listsScience China Information Sciences, 2012
- A New Fast Vertical Method for Mining Frequent PatternsInternational Journal of Computational Intelligence Systems, 2010
- Gene association analysis: a survey of frequent pattern mining from gene expression dataBriefings in Bioinformatics, 2009
- MAFIA: a maximal frequent itemset algorithmIEEE Transactions on Knowledge and Data Engineering, 2005
- Fast algorithms for frequent itemset mining using FP-treesIEEE Transactions on Knowledge and Data Engineering, 2005
- Advances in frequent itemset mining implementationsACM SIGKDD Explorations Newsletter, 2004
- Mining frequent patterns without candidate generationACM SIGMOD Record, 2000