Mining top-k frequent patterns in the presence of the memory constraint
- 7 November 2007
- journal article
- Published by Springer Nature in The VLDB Journal
- Vol. 17 (5) , 1321-1344
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Tight upper bounds on the number of candidate patternsACM Transactions on Database Systems, 2005
- Approximating a collection of frequent sets2004
- Advances in frequent itemset mining implementationsACM SIGKDD Explorations Newsletter, 2004
- Memory issues in frequent itemset mining2004
- Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree ApproachData Mining and Knowledge Discovery, 2004
- Models and issues in data stream systems2002
- Algorithms for association rule mining — a general survey and comparisonACM SIGKDD Explorations Newsletter, 2000
- Mining frequent patterns without candidate generation2000
- Efficient data mining for path traversal patternsIEEE Transactions on Knowledge and Data Engineering, 1998
- Dynamic itemset counting and implication rules for market basket data1997