Frequent pattern discovery with memory constraint

Authors:
Kun-Ta Chuang;Ming-Syan Chen
Affiliations:
National Taiwan University, Taipei, Taiwan, ROC;National Taiwan University, Taipei, Taiwan, ROC
Venue:
Proceedings of the 14th ACM international conference on Information and knowledge management
Year:
2005

Citing 3
Cited 0

Efficient Data Mining for Path Traversal Patterns

IEEE Transactions on Knowledge and Data Engineering
Fast Algorithms for Mining Association Rules in Large Databases

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Tight upper bounds on the number of candidate patterns

ACM Transactions on Database Systems (TODS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We explore in this paper a practicably interesting mining task to retrieve frequent itemsets with memory constraint. As opposed to most previous works that concentrate on improving the mining efficiency or on reducing the memory size by best effort, we first attempt to constrain the upper memory size that can be utilized by mining frequent itemsets in this paper.