Mining top−k frequent patterns without minimum support threshold
- 15 February 2011
- journal article
- Published by Springer Nature in Knowledge and Information Systems
- Vol. 30 (1) , 57-86
Abstract
No abstract availableKeywords
This publication has 38 references indexed in Scilit:
- A new concise representation of frequent itemsets using generators and a positive borderKnowledge and Information Systems, 2007
- Mining top-k frequent patterns in the presence of the memory constraintThe VLDB Journal, 2007
- Frequent pattern mining: current status and future directionsData Mining and Knowledge Discovery, 2007
- Efficient mining of both positive and negative association rulesACM Transactions on Information Systems, 2004
- Selecting the right objective measure for association analysisInformation Systems, 2004
- Discovering all most specific sentencesACM Transactions on Database Systems, 2003
- Dynamic itemset counting and implication rules for market basket dataACM SIGMOD Record, 1997
- Using a hash-based method with transaction trimming for mining association rulesIEEE Transactions on Knowledge and Data Engineering, 1997
- Mining association rules between sets of items in large databasesACM SIGMOD Record, 1993
- A note on two problems in connexion with graphsNumerische Mathematik, 1959