The research of A-Priori Algorithm Candidates Based on Support Counts
文献类型：会议论文
| 作者 | Zhou HY(周焕银); Liu JS(刘金生) |
| 出版日期 | 2009 |
| 会议名称 | International Conference on Information Technology and Computer Science |
| 会议日期 | July 25-26, 2009 |
| 会议地点 | Kiev, UKRAINE |
| 关键词 | A-Priori algorithm associational rule constant onfix item support count independent support count |
| 页码 | 192-195 |
| 中文摘要 | 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. |
| 收录类别 | EI ; CPCI（ISTP） |
| 产权排序 | 1 |
| 会议录 | 2009 INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY AND COMPUTER SCIENCE, VOL 1, PROCEEDINGS
 |
| 会议录出版者 | IEEE COMPUTER SOC |
| 会议录出版地 | LOS ALAMITOS |
| 语种 | 英语 |
| ISBN号 | 978-0-7695-3688-0 |
| WOS记录号 | WOS:000270803600046 |
| 源URL | [http://ir.sia.cn/handle/173321/8915]  |
| 专题 | 沈阳自动化研究所_机器人学研究室 |
| 推荐引用方式 GB/T 7714 | Zhou HY,Liu JS. The research of A-Priori Algorithm Candidates Based on Support Counts[C]. 见:International Conference on Information Technology and Computer Science. Kiev, UKRAINE. July 25-26, 2009. |
入库方式： OAI收割
来源：沈阳自动化研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。