Frequent pattern discovery with memory constraint

Kun-Ta Chuang, Ming Syan Chen

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

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 languageEnglish
Title of host publicationCIKM'05 - Proceedings of the 14th ACM International Conference on Information and Knowledge Management
Pages345-346
Number of pages2
DOIs
Publication statusPublished - 2005
EventCIKM'05 - Proceedings of the 14th ACM International Conference on Information and Knowledge Management - Bremen, Germany
Duration: 2005 Oct 312005 Nov 5

Other

OtherCIKM'05 - Proceedings of the 14th ACM International Conference on Information and Knowledge Management
CountryGermany
CityBremen
Period05-10-3105-11-05

All Science Journal Classification (ASJC) codes

  • Business, Management and Accounting(all)

Cite this