| an improved parallel algorithm for finding frequent item-sets |
| She CD; Li L; Wang HB; Gao B; Deng HQ
|
| 2004
|
| 会议名称 | International Conference on Intelligent Mechatronics and Automation
|
| 页码 | 383-386
|
| 会议日期 | AUG 26-31,
|
| 会议地点 | Chengdu, PEOPLES R CHINA
|
| 收录类别 | istp
|
| 出版地 | 345 E 47TH ST, NEW YORK, NY 10017 USA
|
| 出版者 | PROCEEDINGS OF THE 2004 INTERNATIONAL CONFERENCE ON INTELLIGENT MECHATRONICS AND AUTOMATION
|
| ISBN | 0-7803-8748-1
|
| 部门归属 | Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
|
| 摘要 | Discovery of associations from large-sets becomes increasingly useful in data-mining field. Several sequential and parallel algorithms for discovery of association rules are analyzed in this paper. And based on the efficient FP-growth algorith |
| 关键词 | Data Mining
Parallel Processing
Association Rules
Load Balance
Shared Memory
|
| 主办者 | Hong Kong Univ Sci & Technol, Kagawa Univ, Univ Electro Commun, Natl Nat Sci Fdn China, Shanghai Univ, Harbin Engn Univ, Japan Soc Precis Engn, IEEE Robot & Automat Soc, IEEE Syst, Man & Cybernet Soc, IEEE Shikoku Sect, Chinese Inst Elect, Chi
|
| 语种 | 英语
|
| 内容类型 | 会议论文
|
| URI标识 | http://ir.iscas.ac.cn/handle/311060/13024
|
| 专题 | 中国科学院软件研究所
|
推荐引用方式
GB/T 7714 |
She CD,Li L,Wang HB,et al. an improved parallel algorithm for finding frequent item-sets[C]. 345 E 47TH ST, NEW YORK, NY 10017 USA:PROCEEDINGS OF THE 2004 INTERNATIONAL CONFERENCE ON INTELLIGENT MECHATRONICS AND AUTOMATION,2004:383-386.
|
修改评论