| 最大频繁集的关联规则矩阵视图 |
| |
| 引用本文： | 余力,刘英杰,刘鲁.最大频繁集的关联规则矩阵视图[J].计算机工程与应用,2003,39(24):1-4,36. |
| |
| 作者姓名： | 余力 刘英杰 刘鲁 |
| |
| 作者单位： | 1. 北京航空航天大学经济管理学院,北京,100083
2. 江西宜春学院,江西,宜春,336000 |
| |
| 基金项目： | 国家自然基金资助(编号:79870009)，教育部博士点基金的资助(编号:2000000601) |
| |
| 摘 要： | 文章研究了两个基本的关联规则推导关系,在此基础上建立了最大频繁集的关联规则矩阵视图,把一个频繁集生成的所有规则全部展现在一个矩阵中,并通过研究矩阵中的各规则元素的关系,得到一个频繁集或规则矩阵的基集和核(即最小规则集),可以从大型事务数据库生成的大量关联规则中挖掘出最小规则集和有用户感兴趣的规则。
|
| 关 键 词： | 关联规则 数据挖掘 二次挖掘 算法 |
| 文章编号： | 1002-8331-(2003)24-0001-04 |
Matrix-view of Association Rules Generated by a Maximal Frequent Itemsets |
| |
| Yu Li,Liu Yingjie,Liu Lu.Matrix-view of Association Rules Generated by a Maximal Frequent Itemsets[J].Computer Engineering and Applications,2003,39(24):1-4,36. |
| |
| Authors: | Yu Li Liu Yingjie Liu Lu |
| |
| Affiliation: | Yu Li 1 Liu Yingjie 2 Liu Lu 11 |
| |
| Abstract: | Firstly,two basic inference on association rules is put ,on which matrix-view of association rules generated by a maximal frequent itemsets is based.Using the matrix-view,all association rules generated by a maximal frequent item-sets is described in a matrix,and deducing relation between association rules and base or core of association rules is easily obtained through the matrix-view.The work is significant for finding the interesting and minimal rules. |
| |
| Keywords: | Association rules Data mining The second mining Algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
