an efficient algorithm for mining erasable itemsets
文献类型：会议论文
| 作者 | Deng Zhihong ; Xu Xiaoran |
| 出版日期 | 2010 |
| 会议名称 | 6th International Conference on Advanced Data Mining and Applications, ADMA 2010 |
| 会议日期 | 40848 |
| 会议地点 | Chongqing, China |
| 关键词 | Chemical industry Data mining |
| 页码 | 214-225 |
| 英文摘要 | 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. |
| 收录类别 | EI |
| 会议主办者 | National Natural Science Foundation of China; Chongqing Science and Technology Commission; Chongqing Academy of Science and Technology |
| 会议录 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
 |
| 会议录出版地 | Germany |
| 语种 | 英语 |
| ISSN号 | 3029743 |
| ISBN号 | 3642173152 |
| 源URL | [http://124.16.136.157/handle/311060/8650]  |
| 专题 | 软件研究所_软件所图书馆_2010软件所会议论文 |
| 推荐引用方式 GB/T 7714 | Deng Zhihong,Xu Xiaoran. an efficient algorithm for mining erasable itemsets[C]. 见:6th International Conference on Advanced Data Mining and Applications, ADMA 2010. Chongqing, China. 40848. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。