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

Chuang, K-T., & Chen, M. S. (2005). Frequent pattern discovery with memory constraint. In CIKM'05 - Proceedings of the 14th ACM International Conference on Information and Knowledge Management (pp. 345-346) https://doi.org/10.1145/1099554.1099659
Chuang, Kun-Ta ; Chen, Ming Syan. / Frequent pattern discovery with memory constraint. CIKM'05 - Proceedings of the 14th ACM International Conference on Information and Knowledge Management. 2005. pp. 345-346
@inproceedings{3eaf19877ec342819620d7a4f39017e7,
title = "Frequent pattern discovery with memory constraint",
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.",
author = "Kun-Ta Chuang and Chen, {Ming Syan}",
year = "2005",
doi = "10.1145/1099554.1099659",
language = "English",
isbn = "1595931406",
pages = "345--346",
booktitle = "CIKM'05 - Proceedings of the 14th ACM International Conference on Information and Knowledge Management",

}

Chuang, K-T & Chen, MS 2005, Frequent pattern discovery with memory constraint. in CIKM'05 - Proceedings of the 14th ACM International Conference on Information and Knowledge Management. pp. 345-346, CIKM'05 - Proceedings of the 14th ACM International Conference on Information and Knowledge Management, Bremen, Germany, 05-10-31. https://doi.org/10.1145/1099554.1099659

Frequent pattern discovery with memory constraint. / Chuang, Kun-Ta; Chen, Ming Syan.

CIKM'05 - Proceedings of the 14th ACM International Conference on Information and Knowledge Management. 2005. p. 345-346.

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

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

SN - 1595931406

SN - 9781595931405

SP - 345

EP - 346

BT - CIKM'05 - Proceedings of the 14th ACM International Conference on Information and Knowledge Management

ER -

Chuang K-T, Chen MS. Frequent pattern discovery with memory constraint. In CIKM'05 - Proceedings of the 14th ACM International Conference on Information and Knowledge Management. 2005. p. 345-346 https://doi.org/10.1145/1099554.1099659