Top-K Miner: top-K identical frequent itemsets discovery without user support threshold
- 31 December 2015
- journal article
- Published by Springer Nature in Knowledge and Information Systems
- Vol. 48 (3) , 741-762
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Efficient colossal pattern mining in high dimensional datasetsKnowledge-Based Systems, 2012
- Finding Top-N Colossal Patterns Based on Clique Search with Dynamic Update of Graph2012
- TGP: Mining Top-K Frequent Closed Graph Pattern without Minimum Support2010
- Frequent pattern mining: current status and future directionsData Mining and Knowledge Discovery, 2007
- GenMax: An Efficient Algorithm for Mining Maximal Frequent ItemsetsData Mining and Knowledge Discovery, 2005
- Mining N-most interesting itemsets without support threshold by the COFI-treeInternational Journal of Business Intelligence and Data Mining, 2005
- Mining frequent itemsets without support threshold: with and without item constraintsIEEE Transactions on Knowledge and Data Engineering, 2004
- CHARM: An Efficient Algorithm for Closed Itemset Mining2002
- Mining Access Patterns Efficiently from Web Logs2000
- Discovering Frequent Closed Itemsets for Association Rules1999