NEclatClosed: A vertical algorithm for mining frequent closed itemsets
Authors:
- Nader AryabarzanNANader Aryabarzan
- Behrouz Minaei-BidgoliBMBehrouz Minaei-Bidgoli
- 1 July 2021
- journal article
- research article
- Published by Elsevier in Expert Systems with Applications
- Vol. 174
Abstract
No abstract availableKeywords
This publication has 40 references indexed in Scilit:
- An N-list-based algorithm for mining frequent closed patternsExpert Systems with Applications, 2015
- A distributed frequent itemset mining algorithm using Spark for Big Data analyticsCluster Computing, 2015
- Fast mining frequent itemsets using NodesetsExpert Systems with Applications, 2014
- An effective association rule mining scheme using a new generic basisKnowledge and Information Systems, 2014
- A new algorithm for fast mining frequent itemsets using N-listsScience China Information Sciences, 2012
- DBV-Miner: A Dynamic Bit-Vector approach for fast mining frequent closed itemsetsExpert Systems with Applications, 2012
- GenMax: An Efficient Algorithm for Mining Maximal Frequent ItemsetsData Mining and Knowledge Discovery, 2005
- Mining frequent patterns without candidate generationACM SIGMOD Record, 2000
- Scalable algorithms for association miningIEEE Transactions on Knowledge and Data Engineering, 2000
- Efficient mining of association rules using closed itemset latticesInformation Systems, 1999