Frequent pattern discovery with memory constraint

Kun Ta Chuang; Ming Syan Chen

doi:10.1145/1099554.1099659

Frequent pattern discovery with memory constraint

Kun Ta Chuang
, Ming Syan Chen

Department of Computer Science and Information Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 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	https://doi.org/10.1145/1099554.1099659
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

Publication series

Name	International Conference on Information and Knowledge Management, Proceedings

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

General Business,Management and Accounting

Access to Document

10.1145/1099554.1099659

Cite this

@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 = "Chuang, \{Kun Ta\} and Chen, \{Ming Syan\}",

year = "2005",

doi = "10.1145/1099554.1099659",

language = "English",

isbn = "1595931406",

series = "International Conference on Information and Knowledge Management, Proceedings",

pages = "345--346",

booktitle = "CIKM'05 - Proceedings of the 14th ACM International Conference on Information and Knowledge Management",

note = "CIKM'05 - Proceedings of the 14th ACM International Conference on Information and Knowledge Management ; Conference date: 31-10-2005 Through 05-11-2005",

}

Chuang, KT & Chen, MS 2005, Frequent pattern discovery with memory constraint. in CIKM'05 - Proceedings of the 14th ACM International Conference on Information and Knowledge Management. International Conference on Information and Knowledge Management, Proceedings, 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 (International Conference on Information and Knowledge Management, Proceedings).

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 - https://www.scopus.com/pages/publications/33745771618

UR - https://www.scopus.com/pages/publications/33745771618#tab=citedBy

U2 - 10.1145/1099554.1099659

DO - 10.1145/1099554.1099659

M3 - Conference contribution

AN - SCOPUS:33745771618

SN - 1595931406

SN - 9781595931405

T3 - International Conference on Information and Knowledge Management, Proceedings

SP - 345

EP - 346

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

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

Y2 - 31 October 2005 through 5 November 2005

ER -

Frequent pattern discovery with memory constraint

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this