首页 | 本学科首页   官方微博 | 高级检索  
     检索      

基于粒计算高效挖掘决策型关系数据库中关联规则
引用本文:赵小龙,张步群.基于粒计算高效挖掘决策型关系数据库中关联规则[J].巢湖学院学报,2008,10(3):22-27.
作者姓名:赵小龙  张步群
作者单位:巢湖学院计算机系,巢湖,安徽,238000
摘    要:文章提出了一种基于粒计算从决策型关系数据集中快速提取关联规则方法,按照属性利用等价类对实体进行分类,利用分类后的属性值来构建粒,提出了基于粒计算提取决策型关系数据库的关联规则算法,来提取关系数据集的关联规则,通过实例来验证该方法的有效性,最后给出了性能分析,并指出基于关系数据集上的粒计算在提取关联规则方面的不足。

关 键 词:粒计算  关联规则  关系数据库  数据挖掘
文章编号:1672-2868(2008)03-0022-06
修稿时间:2008年3月6日

MINING ASSOCIATIVE RULES EFFECTIVELY IN DECISION-MAKING RELATION DATABASE BASED ON GRANULAR COMPUTING
ZHAO Xiao-long,ZHANG Bu-qun.MINING ASSOCIATIVE RULES EFFECTIVELY IN DECISION-MAKING RELATION DATABASE BASED ON GRANULAR COMPUTING[J].Chaohu College Journal,2008,10(3):22-27.
Authors:ZHAO Xiao-long  ZHANG Bu-qun
Abstract:The paper has put forward a method based on granular computing to effectively obtain association rules in decision-making relation dataset.Based on granular computing,the method constructs models for the relation dataset,utilizes equivalence class to classify the entity based on attribute so as to construct granules,and brings forward the algorithm based on granular computing to obtain associative rules in decision-making relation dataset.It has been proved effective by empirical study,which yields performance analysis as well as points out the shortcomings of granular computing based on relation dataset in terms of association rules mining.
Keywords:granular computing  association rules  relation database  data mining
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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