Finding Top-N Colossal Patterns Based on Clique Search with Dynamic Update of Graph
Authors:
- 1 January 2012
- book chapter
- Published by Springer Nature
- p. 244-259
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- A Fast Algorithm for Mining Rare Itemsets2009
- Towards Rare Itemset Mining2007
- Mining Colossal Frequent Patterns by Core Pattern Fusion2007
- Frequent pattern mining: current status and future directionsData Mining and Knowledge Discovery, 2007
- MAFIA: a maximal frequent itemset algorithmIEEE Transactions on Knowledge and Data Engineering, 2005
- CLOSET+2003
- Alternative interest measures for mining associations in databasesIEEE Transactions on Knowledge and Data Engineering, 2003
- Efficient mining of association rules using closed itemset latticesInformation Systems, 1999
- Formal Concept Analysis1999
- Efficiently mining long patterns from databasesACM SIGMOD Record, 1998