| 一种高效关联规则挖掘算法 |
| |
| 引用本文： | 王娟勤,李书琴.一种高效关联规则挖掘算法[J].湖南科技大学学报(自然科学版),2011(4):60-64. |
| |
| 作者姓名： | 王娟勤 李书琴 |
| |
| 作者单位： | 西北农林科技大学信息工程学院; |
| |
| 基金项目： | 国家自然科学基金资助项目(61003151) |
| |
| 摘 要： | 为了提高关联规则挖掘算法处理数据库的效率,在研究AprioriTid算法的基础上提出一种高效的关联规则挖掘算法AprioriTidD,在计算数据库中的频繁项集时依靠有效的裁剪减少无效项集的产生,并且可减少产生候选项集,从而有效地提高算法的效率.选取程序模拟超市购物产生的3个试验数据集,应用AprioriTidD算法对该...
|
| 关 键 词： | 关联规则 AprioriTid AprioriTidD 数据挖掘 |
A high-efficient algorithm of mining association rule |
| |
| WANG Juan-qin,LI shu-qin.A high-efficient algorithm of mining association rule[J].Journal of Hunan University of Science & Technology(Natural Science Editon),2011(4):60-64. |
| |
| Authors: | WANG Juan-qin LI shu-qin |
| |
| Institution: | WANG Juan-qin,LI shu-qin(College of Information Engineering,Northwest A&F University,Yangling 712100,China) |
| |
| Abstract: | To improve the efficiency of the algorithm processing the database,a AprioriTidD algorithm was presented,which is a high-efficient algorithm of mining association rule based on the algorithm of AprioriTid,it reduced the table Tid by pruned some transaction and item to prevent the insignificancy item generated.Three test data sets were chosen which were produced by the program to simulate data of supermarket,applying the data set on the AprioriTidD algorithm of mining association rules.Results show that the ... |
| |
| Keywords: | association rule AprioriTid AprioriTidD data mining |
| 本文献已被 CNKI 等数据库收录！ |
|
