| 一种关联规则挖掘的裁剪及优化方法 |
| |
| 引用本文： | 陆楠,.一种关联规则挖掘的裁剪及优化方法[J].吉林大学学报(理学版),2006,44(6):107-115. |
| |
| 作者姓名： | 陆楠 |
| |
| 作者单位： | 1. 吉林大学 计算机科学与技术学院, 长春 130012; 2. 深圳大学 信息工程学院, 广东省 深圳 518060 |
| |
| 摘 要： | 采用χ2相关性检验和有趣度量定义了两种可能的“unexpected”规则, 对关联规则挖掘的裁剪与优化问题给出一个比较全面和系统的解决方法, 并结合规则裁剪提出了完整的算法思想, 通过对实验数据的关联挖掘, 挖掘出有效、 新奇和意想不到的规则. 实验结果表明, 该优化方法具有良好的有效性和伸缩性.
|
| 关 键 词： | 数据挖掘 关联规则 规则裁剪 模板规则 有趣度 |
| 收稿时间： | 2006-05-18 |
An Optimization Method for Association Rules Pruning |
| |
| LU Nan,.An Optimization Method for Association Rules Pruning[J].Journal of Jilin University: Sci Ed,2006,44(6):107-115. |
| |
| Authors: | LU Nan |
| |
| Institution: | 1. College of Computer Science and Technology, Jilin University, Changchun 130012, China； 2. College of Information Engineering, Shenzhen University, Shenzhen 518060, Guangdong Province, China |
| |
| Abstract: | We proposed a method addressing the optimization of the association rules pruning via two kinds of “unexpected” rules defined by the chi square test and interest. We also provided an algorithm on the associat
ion rules pruning. Based on the experiments, the method retrieved some effective
and useful new rules which are often ignored by other methods. The experiment results also show that the method has a satisfying flexibility and effectiveness. |
| |
| Keywords: | data mining association rules rules pruning rules t emplate interest measure |
|
| 点击此处可从《吉林大学学报(理学版)》浏览原始摘要信息 |
| 点击此处可从《吉林大学学报(理学版)》下载免费的PDF全文 |
|
