Laws on Support Counts of Apriori Algorithm Candidates
文献类型：会议论文
| 作者 | Zhou HY(周焕银); Liu JS(刘金生) |
| 出版日期 | 2009 |
| 会议名称 | 1st IITA International Joint Conference on Artificial Intelligence |
| 会议日期 | April 25-May 26, 2009 |
| 会议地点 | Hainan Isl, China |
| 关键词 | A-Priori algorithm associational rule constant on fix item support count independent support count |
| 页码 | 120-123 |
| 中文摘要 | This paper proposes three novel laws for finding useful candidates in database and preventing useless candidates by researching frequent itemset support. Some new concepts are introduced so as to explain these three laws. For example, independent itemset and support count, which can effectively avoid losing any interest associational rules during pruning, are introduced. In this paper, firstly, some key definitions on these approaches are presented such as support count, constant support count on fixed item sets then three novel approaches are detailed. Secondly, demonstrations and applications on these approaches are presented. The application of these approaches is used to test significances of these laws by an example which proves that these novel approaches can more efficiently reduce redundant candidates than A-Priori algorithm. |
| 收录类别 | EI ; CPCI（ISTP） |
| 产权排序 | 1 |
| 会议主办者 | IITA, Engn Technol Press, IEEE SMC TC Educ Technol & Training, Intelligent Informat Technol Applicat Res Assoc, Wuhan Inst Technol, Huazhong Normal Univ |
| 会议录 | FIRST IITA INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, PROCEEDINGS
 |
| 会议录出版者 | IEEE COMPUTER SOC |
| 会议录出版地 | LOS ALAMITOS |
| 语种 | 英语 |
| ISBN号 | 978-0-7695-3615-6 |
| WOS记录号 | WOS:000271280800032 |
| 源URL | [http://ir.sia.cn/handle/173321/8757]  |
| 专题 | 沈阳自动化研究所_机器人学研究室 |
| 推荐引用方式 GB/T 7714 | Zhou HY,Liu JS. Laws on Support Counts of Apriori Algorithm Candidates[C]. 见:1st IITA International Joint Conference on Artificial Intelligence. Hainan Isl, China. April 25-May 26, 2009. |
入库方式： OAI收割
来源：沈阳自动化研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。