Frequent pattern discovery with memory constraint

Kun-Ta Chuang, Ming Syan Chen

研究成果: Conference contribution

1 引文 斯高帕斯(Scopus)

摘要

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.

原文English
主出版物標題CIKM'05 - Proceedings of the 14th ACM International Conference on Information and Knowledge Management
頁面345-346
頁數2
DOIs
出版狀態Published - 2005
事件CIKM'05 - Proceedings of the 14th ACM International Conference on Information and Knowledge Management - Bremen, Germany
持續時間: 2005 十月 312005 十一月 5

Other

OtherCIKM'05 - Proceedings of the 14th ACM International Conference on Information and Knowledge Management
國家Germany
城市Bremen
期間05-10-3105-11-05

All Science Journal Classification (ASJC) codes

  • Business, Management and Accounting(all)

引用此