negFIN: An efficient algorithm for fast mining frequent itemsets
Authors:
- Nader AryabarzanNANader Aryabarzan
- Behrouz Minaei-BidgoliBMBehrouz Minaei-Bidgoli
- Mohammad TeshnehlabMTMohammad Teshnehlab
- 1 September 2018
- journal article
- research article
- Published by Elsevier in Expert Systems with Applications
- Vol. 105, 129-143
Abstract
No abstract availableKeywords
This publication has 33 references indexed in Scilit:
- Mining frequent patterns from network flows for monitoring networkExpert Systems with Applications, 2010
- An efficient algorithm for mining closed inter-transaction itemsetsData & Knowledge Engineering, 2008
- Association miningACM Computing Surveys, 2006
- A Support-Ordered Trie for Fast Frequent Itemset DiscoveryIEEE Transactions on Knowledge and Data Engineering, 2004
- Advances in frequent itemset mining implementationsACM SIGKDD Explorations Newsletter, 2004
- Turbo-charging vertical mining of large databasesACM SIGMOD Record, 2000
- Mining frequent patterns without candidate generationACM SIGMOD Record, 2000
- Scalable algorithms for association miningIEEE Transactions on Knowledge and Data Engineering, 2000
- Efficiently mining long patterns from databasesACM SIGMOD Record, 1998
- Mining association rules between sets of items in large databasesACM SIGMOD Record, 1993