中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 软件所图书馆  > 2010软件所会议论文
Title:
an efficient algorithm for mining erasable itemsets
Author: Deng Zhihong ; Xu Xiaoran
Source: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Conference Name: 6th International Conference on Advanced Data Mining and Applications, ADMA 2010
Conference Date: 40848
Issued Date: 2010
Conference Place: Chongqing, China
Keyword: Chemical industry ; Data mining
Publish Place: Germany
Indexed Type: ei
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
Sponsorship: National Natural Science Foundation of China; Chongqing Science and Technology Commission; Chongqing Academy of Science and Technology
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.
Language: 英语
Content Type: 会议论文
URI: http://ir.iscas.ac.cn/handle/311060/8650
Appears in Collections:中科院软件所图书馆_2010软件所会议论文

Files in This Item:
File Name/ File Size Content Type Version Access License
an efficient algorithm for mining erasable itemsets.pdf(222KB)----限制开放-- 联系获取全文

Recommended Citation:
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.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Deng Zhihong]'s Articles
[Xu Xiaoran]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Deng Zhihong]‘s Articles
[Xu Xiaoran]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

 

Valid XHTML 1.0!
Copyright © 2007-2019  中国科学院软件研究所 - Feedback
Powered by CSpace