Efficient colossal pattern mining in high dimensional datasets
- 15 March 2012
- journal article
- Published by Elsevier in Knowledge-Based Systems
- Vol. 33, 41-52
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Optimizing Frequent Pattern Mining through Elimination of Null Transactions2011
- Index-BitTableFI: An improved algorithm for mining frequent itemsetsKnowledge-Based Systems, 2008
- CLOSET+2003
- Mining frequent item sets by opportunistic projection2002
- CHARM: An Efficient Algorithm for Closed Itemset Mining2002
- A Tree Projection Algorithm for Generation of Frequent Item SetsJournal of Parallel and Distributed Computing, 2001
- Mining frequent patterns without candidate generation2000
- Discovering Frequent Closed Itemsets for Association Rules1999
- Efficiently mining long patterns from databases1998
- Mining association rules between sets of items in large databases1993