A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Frequent pattern discovery with memory constraint
2005
Proceedings of the 14th ACM international conference on Information and knowledge management - CIKM '05
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.
doi:10.1145/1099554.1099659
dblp:conf/cikm/ChuangC05
fatcat:p277xfsqgncyzmxeqyuzrhgqsi