摘要
属性约简是粗糙集理论中的重要研究内容之一,求核运算是属性约简的基础,直接影响着知识约简的效率。针对目前求核方法存在的问题,基于改进的二进制可辨矩阵及属性核计算方法,提出核属性的增量式更新方法。只需简单更改二进制可辨矩阵的结构,就可以计算动态变化的决策表的核属性,并通过实例验证了该方法的正确性和有效性。
Attribution reduction is one of the important topics in the research on rough set theory. The core obtaining lays a foundation in the attribute reduction, which affects the efficiency of attribute reduction. An incremental updating approach to computing a core is presented based on the improved binary discemable matrix and the methot for computing the core. Only modifying the structure of binary discernable matrix simply, it is easy to compute the core of a changeable decision table. The method is demonstrated to he right and effective with the example.
出处
《计算机技术与发展》
2009年第1期97-99,102,共4页
Computer Technology and Development
基金
安徽省自然科学基金项目(KJ2007B245)
关键词
粗糙集
二进制可辨矩阵
增量
核
rough set
binary diseemable matrix
increment
core
