A Novel Algorithm for Association Rule Mining Without Candidate
文献类型：会议论文
| 作者 | Zhou HY(周焕银); Liu JS(刘金生) |
| 出版日期 | 2009 |
| 会议名称 | 1st IITA International Joint Conference on Artificial Intelligence |
| 会议日期 | April 25-May 26, 2009 |
| 会议地点 | Hainan Isl, China |
| 关键词 | association rule mining And Code algorithm frequent itemsets A-Priori algorithm |
| 页码 | 116-119 |
| 中文摘要 | A-Priori is an influence algorithm for finding frequent itemsets from association rules. But there are two hard questions may be involved for average users during finding frequent candidates. One question is massive amounts of candidates and the other is that set support count threshold for every level candidate generations. This paper discusses one algorithm called And, which is usually used in logical algorithms, And Code (AC) algorithm can discover frequent itemsets without producing candidates and setting thresholds for candidates. Frequent itemsets can be fast discovered by corresponding codes which are cited by this paper to describe different itemsets for AC algorithm. The support count of frequent itemsets can be computed before the process of scanning during processes of AC algorithm. The codes of itemsets are defined and detailed in section two. Lastly, an example is presented to detail processes of AC algorithm and test that AC algorithm can more efficiently find frequent without candidates than A-Priori algorithm which may produce a large of candidates during scan process. |
| 收录类别 | 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:000271280800031 |
| 源URL | [http://ir.sia.cn/handle/173321/8500]  |
| 专题 | 沈阳自动化研究所_机器人学研究室 |
| 推荐引用方式 GB/T 7714 | Zhou HY,Liu JS. A Novel Algorithm for Association Rule Mining Without Candidate[C]. 见:1st IITA International Joint Conference on Artificial Intelligence. Hainan Isl, China. April 25-May 26, 2009. |
入库方式： OAI收割
来源：沈阳自动化研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。