基于区别度概念格的关联规则的挖掘  

Association rules mining based on discriminative concept lattice

作　　者：王培培[1,2] 沈夏炯[1,2] 王倩[2] 周博[2] 

机构地区：[1]河南大学数据与知识工程研究所,河南开封475004 [2]河南大学计算机与信息工程学院,河南开封475001

出　　处：《计算机应用研究》2009年第12期4550-4552,4576,共4页Application Research of Computers

基　　金：国家"863"计划资助项目(2007AA04Z148)

摘　　要：针对大部分文献在构造概念格时都把属性看做是同等重要,而将导致冗余问题,提出了一个新的概念———属性区别度(内涵区别度)。在建造概念格的过程中将去掉那些属性区别度(D ISP)比较低的内涵,从而加速概念格的构造;同时不再每一次都扫描数据库计算项集或内涵的支持度,而是有条件地计算和重置D ISP,这将减少扫描数据库的次数,从而达到减少生成关联规则时间的目的。Most of literatures did not take into account the differences of attributed when building concept lattice. This paper proposed a new concept called discriminative attribute （discriminative intension）. Every attribute had DISP. In the process of building concept lattice, it could remove the attributes of low discriminative power, then sped up the step of constructing the lattice. Furthermore, there had been a new method to calculate the DISP and reset the value under some condition, but scan the database on each layer, which reduce the number of scanning the database, then decrease the time of generate association rules.

关 键 词：属性区别度 概念格 关联规则 DISP(属性区别度) 

分 类 号：TP31[自动化与计算机技术—计算机软件与理论]