TY - GEN
T1 - Frequent pattern discovery with memory constraint
AU - Chuang, Kun Ta
AU - Chen, Ming Syan
PY - 2005
Y1 - 2005
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=33745771618&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33745771618&partnerID=8YFLogxK
U2 - 10.1145/1099554.1099659
DO - 10.1145/1099554.1099659
M3 - Conference contribution
AN - SCOPUS:33745771618
SN - 1595931406
SN - 9781595931405
T3 - International Conference on Information and Knowledge Management, Proceedings
SP - 345
EP - 346
BT - CIKM'05 - Proceedings of the 14th ACM International Conference on Information and Knowledge Management
T2 - CIKM'05 - Proceedings of the 14th ACM International Conference on Information and Knowledge Management
Y2 - 31 October 2005 through 5 November 2005
ER -