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 |
| 会议日期 | AUG 26-31, |
| 会议地点 | Chengdu, PEOPLES R CHINA |
| 关键词 | data mining parallel processing association rules load balance shared memory |
| 页码 | 383-386 |
| 英文摘要 | 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 |
| 收录类别 | ISTP |
| 会议主办者 | 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 |
| 会议录出版者 | PROCEEDINGS OF THE 2004 INTERNATIONAL CONFERENCE ON INTELLIGENT MECHATRONICS AND AUTOMATION |
| 会议录出版地 | 345 E 47TH ST, NEW YORK, NY 10017 USA |
| 语种 | 英语 |
| ISBN号 | 0-7803-8748-1 |
| 源URL | [http://124.16.136.157/handle/311060/13024]  |
| 专题 | 软件研究所_软件所图书馆_会议论文 |
| 推荐引用方式 GB/T 7714 | She CD,Li L,Wang HB,et al. an improved parallel algorithm for finding frequent item-sets[C]. 见:International Conference on Intelligent Mechatronics and Automation. Chengdu, PEOPLES R CHINA. AUG 26-31,. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。