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

資訊工程學系

研究成果: Conference contribution

1 引文斯高帕斯（Scopus）

摘要

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	https://doi.org/10.1145/1099554.1099659
出版狀態	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)

存取文件

10.1145/1099554.1099659

引用此

@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",

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

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

AN - SCOPUS:33745771618

SN - 1595931406

SN - 9781595931405

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 -