节点文献
一种小支持度布尔关联规则的挖掘方法
A Method of Mining Lightly-supported Boolean Association Rules
【摘要】 关联规则挖掘算法一般用于发现强关联规则,对于小支持度规则的挖掘则缺少有效的算法.利用事务数据的时间特性,将事务数据集划分成若干子集,对子集进行挖掘,并在得到的规则集基础上建立规则矩阵,过滤矩阵,得到一种挖掘事务数据集中小支持度布尔关联规则的新方法.
【Abstract】 The mining of association rules mainly aims to the strong association rules,and lacks of efficient methods of mining the rules which don’t occur frequently.By the time property of items,a transaction set can be divided into several sub-sets.By mining the association rules,setting up rule matrix and filtering the matrix,a new method is presented to mine the lightly-supported Boolean association rules.
【关键词】 数据挖掘;
关联规则;
支持度;
Apriori算法;
【Key words】 data mining; association rules; support; Apriori algorithm;
【Key words】 data mining; association rules; support; Apriori algorithm;
- 【文献出处】 兰州交通大学学报 ,Journal of Lanzhou Jiaotong University , 编辑部邮箱 ,2007年03期
- 【分类号】TP311.13
- 【被引频次】2
- 【下载频次】51