Institutional Repository
| an efficient algorithm for mining erasable itemsets | |
| Deng Zhihong; Xu Xiaoran | |
| 2010 | |
| Conference Name | 6th International Conference on Advanced Data Mining and Applications, ADMA 2010 |
| Source | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Pages | 214-225 |
| Conference Date | 40848 |
| Conference Place | Chongqing, China |
| Indexed Type | ei |
| Publish Place | Germany |
| ISSN | 3029743 |
| ISBN | 3642173152 |
| Department | (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 |
| English Abstract | 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. |
| Keyword | Chemical Industry Data Mining |
| Sponsorship | National Natural Science Foundation of China; Chongqing Science and Technology Commission; Chongqing Academy of Science and Technology |
| Language | 英语 |
| Content Type | 会议论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/8650 |
| Collection | 2010软件所会议论文 |
| Recommended Citation GB/T 7714 | Deng Zhihong,Xu Xiaoran. an efficient algorithm for mining erasable itemsets[C]. Germany,2010:214-225. |
| Files in This Item: | ||||||
| File Name/Size | DocType | Version | Access | License | ||
| an efficient algorit（222KB） | 限制开放 | -- | Application Full Text | |||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment