检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]南京师范大学数学与计算机科学学院
出 处:《计算机应用》2005年第3期639-642,共4页journal of Computer Applications
基 金:国家自然科学基金资助项目(70371015)
摘 要:研究了Rough集理论中属性约简和值约简问题,扩展了决策矩阵的定义,提出了一种基于决策矩阵的完备属性约简算法,该算法利用决策属性把论域划分成多个等价类,然后利用每个等价类对应的决策矩阵计算属性约简。与区分矩阵相比,采用决策矩阵可以有效地减少存储空间,提高约简算法效率。同时,借助决策矩阵进行值约简,提出了一种新的规则提取算法,使最终得到的决策规则更加简洁。实验结果表明,本文提出的属性约简和值约简算法是正确、有效、可行的。Two important issues in rough set, attribute reduction and value reduction, were discussed. The definition of extended decision matrices was presented. A novel algorithm based on extended decision matrices for attribute reduction(EDMAR) was proposed. Some equivalence classes were partitioned from the universe of objects by the decision attributes, and decision matrix for each equivalence class was created. Using the decision matrices, the attributes were reduced. Compared with algorithms based on discernibility matrices, EDMAR is of much less space complexity and time complexity. Furthermore, a new algorithm for rule extraction based on decision matrices was presented. And much more concise decision rules could be got with this method. Experimental results on the data sets in UCI machine learning repository show that the algorithms are efficient and feasible.
关 键 词:ROUGH集 属性约简 值约简 决策矩阵 规则提取
分 类 号:TP311.13[自动化与计算机技术—计算机软件与理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.189.13.48