中国科学院沈阳自动化研究所机构知识库
Advanced  
SIA OpenIR  > 机器人学研究室  > 会议论文
题名: The research of A-Priori Algorithm Candidates Based on Support Counts
作者: Zhou HY(周焕银) ; Liu JS(刘金生)
作者部门: 机器人学研究室
会议名称: International Conference on Information Technology and Computer Science
会议日期: July 25-26, 2009
会议地点: Kiev, UKRAINE
会议录: 2009 INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY AND COMPUTER SCIENCE, VOL 1, PROCEEDINGS
会议录出版者: IEEE COMPUTER SOC
会议录出版地: LOS ALAMITOS
出版日期: 2009
页码: 192-195
收录类别: CPCI(ISTP) ; EI
ISBN号: 978-0-7695-3688-0
关键词: A-Priori algorithm ; associational rule ; constant onfix item support count ; independent support count
摘要: Apriori algorithm is one of the most standard, popular way among associational rule mining algorithms. Its famous character 'all the sub-frequent itemsets are frequent itemsets, and no one itemset is frequent if its sub-frequent is infrequent itemsets' has been reduction the number of candidate itemsets, but the number of candidate itemsets is still large. Moreover, the ratio is so small between frequent itemsets and candidate itemsets that the largest time is wasted in checking the candidate itemsets. According to the character of Apriori, this paper sums up three regularities to improve the ratio of useful candidates. At the same time the independent support count is cited to prune the frequent itemsets who are independent their father itemsets. The optimize algorithm has been proved and realized by one database. This paper is arranged as the following: section 2 presents some key definitions on these rules such as support count, attenuation to support count, constant support count on fixed itemsets and three rules will be introduced shortly. Demonstrations and applications on these rules will be detailed in section 3. Section 4 introduces the algorithm of rules and an example is introduced to test the efficiency of these rules. The last section draws some conclusions and future works.
语种: 英语
产权排序: 1
内容类型: 会议论文
URI标识: http://ir.sia.cn/handle/173321/8915
Appears in Collections:机器人学研究室_会议论文

Files in This Item: Download All
File Name/ File Size Content Type Version Access License
HYQW001160.pdf(288KB)----开放获取View Download

Recommended Citation:
周焕银; 刘金生.The research of A-Priori Algorithm Candidates Based on Support Counts.见:IEEE COMPUTER SOC.2009 INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY AND COMPUTER SCIENCE, VOL 1, PROCEEDINGS,LOS ALAMITOS,2009,192-195
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[周焕银]'s Articles
[刘金生]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[周焕银]‘s Articles
[刘金生]‘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
文件名: HYQW001160.pdf
格式: Adobe PDF
此文件暂不支持浏览
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

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

 

 

Valid XHTML 1.0!
Copyright © 2007-2016  中国科学院沈阳自动化研究所 - Feedback
Powered by CSpace