基于粒计算的序决策规则提取算法  

Ordered Decision Rules Extraction Algorithm Based on Granular Computing

作　　者：徐久成 史进玲[1,2] 张倩倩[1] 

机构地区：[1]河南师范大学计算机与信息技术学院智能信息处理重点实验室,新乡453007 [2]许昌学院国际教育学院,许昌461000

出　　处：《模式识别与人工智能》2009年第4期660-665,共6页Pattern Recognition and Artificial Intelligence

基　　金：国家自然科学基金项目(No.60873104);河南省高校新世纪优秀人才支持计划项目(No.2006HANCET-19);河南省教育厅自然科学基金项目(No.2008B520019)资助

摘　　要：为了从序决策表中获取最简有序规则,在研究粒计算理论的基础上,提出一种基于粒计算的序决策规则提取算法.该算法通过定义有序矩阵、λ阶粒库的概念,利用粒计算的思想将序决策表转化为有序矩阵形式.并对有序矩阵及其对应的粒库进行分析推理,以规则覆盖度和置信度为搜索条件,尝试从较低阶的粒库中提取出尽可能多满足用户期望的最简有序规则.最后通过实例验证该算法的有效性.An algorithm for extracting ordered decision rules based on granular computing is proposed to extract the most compact ordered decision rule from the ordered decision table. Firstly, an ordered decision table is transformed into the form of the ordered matrix by defining the concept of the ordered matrix and the ）t- rank granular base about ordered decision table. Then, the ordered matrix and granular bases are studied and analyzed from different granularity level. Moreover, the algorithm is implemented for extracting the ordered decision rules, which satifies user expectation, as many as possible from the lower rank granular base with the search criteria of the lowest limitation of rule coverage and confidence. Finally, the validity for the algorithm is proved by analyzing examples.

关 键 词：序决策表 粒计算 有序矩阵 决策规则 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]