摘要
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 十月 31 → 2005 十一月 5 |
Other
Other | CIKM'05 - Proceedings of the 14th ACM International Conference on Information and Knowledge Management |
---|---|
國家 | Germany |
城市 | Bremen |
期間 | 05-10-31 → 05-11-05 |
All Science Journal Classification (ASJC) codes
- Business, Management and Accounting(all)