周剑云, 王丽珍, 何婧. 基于封闭项目关联规则集压缩方法[J]. 云南大学学报(自然科学版), 2004, 26(4): 301-305.
引用本文: 周剑云, 王丽珍, 何婧. 基于封闭项目关联规则集压缩方法[J]. 云南大学学报(自然科学版), 2004, 26(4): 301-305.
ZHOU Jian-yun, WANG Li-zhen, HE Qian. A compact method for association rules based on closed items[J]. Journal of Yunnan University: Natural Sciences Edition, 2004, 26(4): 301-305.
Citation: ZHOU Jian-yun, WANG Li-zhen, HE Qian. A compact method for association rules based on closed items[J]. Journal of Yunnan University: Natural Sciences Edition, 2004, 26(4): 301-305.

基于封闭项目关联规则集压缩方法

A compact method for association rules based on closed items

  • 摘要: 关联规则挖掘能使我们发现数据库中大量项目与项目之间的相关关系,但是用传统关联规则生成方法所生成的规则一是数量庞大,二是其中包含许多具有相同意义的规则,这必然对用户理解和提取信息带来干扰.通过求封闭项目集大大消减了频繁项目集数量,再由封闭项目集构造一种新的存储机制——-近似格,基于近似格可以得到冗余度较小的关联规则,从而提供用户简洁紧凑又无信息丢失的关联规则集.

     

    Abstract: Association rule mining can discover a lot of interesting relations among a large number of items of database.But the traditional association rule mining framework produces too many rules and many of them implicate the same means which will disturb understand and extract information for users.Through found the closed items it can be dramatically reduced the number of frequent itemsets.It is present a new framing of store namely pseudo lattice.At the help of pseudo lattice it is discovered association rules with few redundant,so both simplify and without loss of information for association rules present to user.

     

/

返回文章
返回