摘要
关联规则是数据挖掘的主要技术之一,是指从一个大型的数据集中发现有趣的关联或相关关系,即从数据集中识别出频繁项集,然后再利用这些频繁集创建描述关联规则的过程。频繁项集挖掘是关联规则挖掘的主要步骤,在频繁项集挖掘中,需要大量进行两个操作:判断两个k-项集是否是前k-1项相同且最后一项不同,即连接步;判断一个项集是否为另一个项集的子集,即剪枝步,通过减少连接操作和剪枝操作的循环次数,以此来提高Apriori算法的效率。
Association rule is one of the key technologies of data mining to find the funny association or relationship from the given clataset,it is to say,association rule is to extract frequent item set from the dataset at first,and then establish the process of description of assoeiation rule according to frequent item. The frequent itemsets mining is the main steps of association rule mining. In the frequent itemsets mining,need to carry out a large number of two operations：judge the two k - item sets of whether the former k - 1 of the same and the last different,that is step- by- step connection;to determine whether an item set for another subset of the set, that is step - by- step pruning,can reduce the times of cycle the connect operation and the pruning operation, in order to improve the efficiency of Apriori algorithm.
出处
《计算机技术与发展》
2009年第6期80-83,共4页
Computer Technology and Development
基金
2007年安徽省高校青年教师资助计划项目(2007jq1197)
