| 一种新的关联规则抽样算法 |
| |
| 引用本文： | 秦如新,陈静,冯一宁.一种新的关联规则抽样算法[J].中国农业大学学报,2007,12(3):85-88. |
| |
| 作者姓名： | 秦如新 陈静 冯一宁 |
| |
| 作者单位： | 中国农业大学,理学院,北京,100083 |
| |
| 摘 要： | 针对目前经典的关联规则挖掘Apriori算法需对数据库多次扫描费时多计算量大,而抽样扫描会造成挖掘精确度下降等问题,采用控制样本频繁项目集的方法,利用频繁1项集进行抽样处理,对关联规则挖掘的抽样操作和精度控制进行研究,提出了基于抽样操作的关联规则挖掘算法——HAC算法。理论分析及性能试验结果表明:HAC算法能够有效缩减数据库规模,至少少扫描数据库1次,提高了关联规则挖掘的效率,同时其计算精度不受影响。
|
| 关 键 词： | 关联规则 抽样 准则系数 Apriori算法 HAC算法 |
| 文章编号： | 1007-4333（2007）03-0085-04 |
| 修稿时间： | 2006-10-25 |
A new sampling algorithm for association rule |
| |
| Qin Ruxin,Chen Jing,Feng Yining.A new sampling algorithm for association rule[J].Journal of China Agricultural University,2007,12(3):85-88. |
| |
| Authors: | Qin Ruxin Chen Jing Feng Yining |
| |
| Institution: | College of Science, China Agricultural University, Beijing 100083, China |
| |
| Abstract: | In order to reduce the long time spent for scanning the database by using Apriori algorithm,which may descend the mining accuracy,the research on the sample operation and precision control with the help of frequent item-set,especially,the frequent 1-item-set is presented in this paper.The HAC algorithm based on sampling was designed.The results in theory and capability experiment indicated that HAC algorithm could decrease the scanning times by at least once,promote the efficiency of mining and improve the computation precision. |
| |
| Keywords: | association rule sampling guide coefficient Apriori algorithm HAC algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《中国农业大学学报》浏览原始摘要信息 |
| 点击此处可从《中国农业大学学报》下载免费的PDF全文 |
|
