| 基于覆盖运算的代表关联规则挖掘 |
| |
| 引用本文： | 王新.基于覆盖运算的代表关联规则挖掘[J].计算机工程与应用,2006,42(2):176-178. |
| |
| 作者姓名： | 王新 |
| |
| 作者单位： | 云南民族大学数学与计算机科学学院,昆明,650031 |
| |
| 摘 要： | 在大型数据库项目之间挖掘出的关联规则数常常是巨大的。为缩减关联规则表示,该文基于覆盖运算的定义,讨论如何从已知关联规则导出其它关联规则,指出存在能覆盖全部关联规则的代表关联规则集,最后给出计算代表规则的算法。
|
| 关 键 词： | 数据挖掘 代表关联规则 覆盖运算 k-规则 |
| 文章编号： | 1002-8331-（2006）02-0176-03 |
Mining Representative Association Rules Based on Cover Operator |
| |
| Wang Xin.Mining Representative Association Rules Based on Cover Operator[J].Computer Engineering and Applications,2006,42(2):176-178. |
| |
| Authors: | Wang Xin |
| |
| Affiliation: | School of Mathematics and Computer Science,Yunnan University of Nationalities,Kunming 650031 |
| |
| Abstract: | Discovering association rules between items in a larger database is usually huge.In this paper,we define a cover operator and discuss how to derive other association rules from a given association rule for reduction of association rules.There is a set of Representative Association rules that covers all association rules are indicated.Finally we offer an algorithm computing Representative Association rules. |
| |
| Keywords: | data mining representative association rules cover operator k-rule |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
