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.
| Original language | English |
|---|---|
| Title of host publication | CIKM'05 - Proceedings of the 14th ACM International Conference on Information and Knowledge Management |
| Pages | 345-346 |
| Number of pages | 2 |
| DOIs | |
| Publication status | Published - 2005 |
| Event | CIKM'05 - Proceedings of the 14th ACM International Conference on Information and Knowledge Management - Bremen, Germany Duration: 2005 Oct 31 → 2005 Nov 5 |
Other
| Other | CIKM'05 - Proceedings of the 14th ACM International Conference on Information and Knowledge Management |
|---|---|
| Country/Territory | Germany |
| City | Bremen |
| Period | 05-10-31 → 05-11-05 |
All Science Journal Classification (ASJC) codes
- Business, Management and Accounting(all)