Institutional Repository
| an efficient algorithm for mining erasable itemsets | |
| Deng Zhihong; Xu Xiaoran | |
| 2010 | |
| 会议名称 | 6th International Conference on Advanced Data Mining and Applications, ADMA 2010 |
| 会议录名称 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| 页码 | 214-225 |
| 会议日期 | 40848 |
| 会议地点 | Chongqing, China |
| 收录类别 | ei |
| 出版地 | Germany |
| ISSN | 3029743 |
| ISBN | 3642173152 |
| 部门归属 | (1) Key Laboratory of Machine Perception (Ministry of Education), School of Electronics Engineering and Computer Science, Peking University, Beijing 100871, China; (2) State Key Lab. of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing 100190, China |
| 摘要 | Mining erasable itemsets first introduced in 2009 is one of new emerging data mining tasks. In this paper, we present a new data representation called PID-list, which keeps track of the id-nums (identification number) of products that include an itemset. Based on PID-list, we propose a new algorithm called VME for mining erasable itemsets efficiently. The main advantage of VME algorithm is that the gain of an itemset can be computed efficiently via union operations on product id-nums. In addition, VME algorithm can also automatically prune irrelevant data. For evaluating VME algorithm, we have conducted experiments on six synthetic product databases. Our performance study shows that the VME algorithm is efficient and is on average over two orders of magnitude faster than the META algorithm, which is the first algorithm for dealing with the problem of erasable itemsets mining. © 2010 Springer-Verlag. |
| 关键词 | Chemical Industry Data Mining |
| 主办者 | National Natural Science Foundation of China; Chongqing Science and Technology Commission; Chongqing Academy of Science and Technology |
| 语种 | 英语 |
| 内容类型 | 会议论文 |
| URI标识 | http://ir.iscas.ac.cn/handle/311060/8650 |
| 专题 | 2010软件所会议论文 |
| 推荐引用方式 GB/T 7714 | Deng Zhihong,Xu Xiaoran. an efficient algorithm for mining erasable itemsets[C]. Germany,2010:214-225. |
| 条目包含的文件 | ||||||
| 文件名称/大小 | 文献类型 | 版本类型 | 开放类型 | 使用许可 | ||
| an efficient algorit(222KB) | 限制开放 | -- | 请求全文 | |||
| 个性服务 |
| 推荐该条目 |
| 保存到收藏夹 |
| 查看访问统计 |
| 导出为Endnote文件 |
| 谷歌学术 |
| 谷歌学术中相似的文章 |
| [Deng Zhihong]的文章 |
| [Xu Xiaoran]的文章 |
| 百度学术 |
| 百度学术中相似的文章 |
| [Deng Zhihong]的文章 |
| [Xu Xiaoran]的文章 |
| 必应学术 |
| 必应学术中相似的文章 |
| [Deng Zhihong]的文章 |
| [Xu Xiaoran]的文章 |
| 相关权益政策 |
| 暂无数据 |
| 收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论