| 基于邻接格的规则集压缩方法 |
| |
| 引用本文： | 周剑云,王丽珍,何婧. 基于邻接格的规则集压缩方法[J]. 计算机工程与应用, 2004, 40(21): 174-177 |
| |
| 作者姓名： | 周剑云 王丽珍 何婧 |
| |
| 作者单位： | 云南大学信息学院计算机科学与工程系,昆明,650091;云南大学信息学院计算机科学与工程系,昆明,650091;云南大学信息学院计算机科学与工程系,昆明,650091 |
| |
| 基金项目： | 云南省自然科学基金资助项目(编号:2002F0013M) |
| |
| 摘 要： | 关联规则挖掘能使你们发现大量数据中项目集之间有趣的关联或相关关系,通过研究发现,用传统关联规则方法会生成大量包含重复意义的规则,这必然会对用户迅速做出决策产生干扰。该文提出了一种基于邻接格的规则集压缩方法,使生成的规则大大精化,从而提供给用户简洁紧凑的关联规则集。
|
| 关 键 词： | 关联规则 邻接格 规则集 |
| 文章编号： | 1002-8331-(2004)21-0174-04 |
A Compact Method for Association Rules Based on Adjacent Lattice |
| |
| Zhou Jianyun Wang Lizhen He Jing. A Compact Method for Association Rules Based on Adjacent Lattice[J]. Computer Engineering and Applications, 2004, 40(21): 174-177 |
| |
| Authors: | Zhou Jianyun Wang Lizhen He Jing |
| |
| Abstract: | Association rule mining can discover a lot of interesting and correlation relations among a large number of objects in a given database.But the traditional association rule mining framework produces too many rules and many of them implicate the same means which will disturb the decisions of users.In this paper,we present a compact method for rules based on adjacent lattice,this method will present user with simplify association rules set. |
| |
| Keywords: | association rules adjacent lattice rules set |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
