首页 | 官方网站   微博 | 高级检索  
     

基于区别度概念格的关联规则的挖掘*
引用本文:王培培,沈夏炯,王倩,周博.基于区别度概念格的关联规则的挖掘*[J].计算机应用研究,2009,26(12):4550-4552.
作者姓名:王培培  沈夏炯  王倩  周博
作者单位:1. 河南大学,数据与知识工程研究所,河南,开封,475004;河南大学,计算机与信息工程学院,河南,开封,475001
2. 河南大学,计算机与信息工程学院,河南,开封,475001
基金项目:国家“863”计划资助项目(2007AA04Z148)
摘    要:针对大部分文献在构造概念格时都把属性看做是同等重要,而将导致冗余问题,提出了一个新的概念——属性区别度(内涵区别度)。在建造概念格的过程中将去掉那些属性区别度(DISP)比较低的内涵,从而加速概念格的构造;同时不再每一次都扫描数据库计算项集或内涵的支持度,而是有条件地计算和重置DISP,这将减少扫描数据库的次数,从而达到减少生成关联规则时间的目的。

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

Association rules mining based on discriminative concept lattice
WANG Pei-pei,SHEN Xia-jiong,WANG Qian,ZHOU Bo.Association rules mining based on discriminative concept lattice[J].Application Research of Computers,2009,26(12):4550-4552.
Authors:WANG Pei-pei  SHEN Xia-jiong  WANG Qian  ZHOU Bo
Abstract: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.
Keywords:discriminative attribute  concept lattice  association rules  discriminative power(DISP)
本文献已被 万方数据 等数据库收录!
点击此处可从《计算机应用研究》浏览原始摘要信息
点击此处可从《计算机应用研究》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号