Rough集理论中几个基本概念的算法描述

Algorithms of several basic concepts in Rough set theory

用信息向量表示信息表知识表达系统中的对象,基于同一思想用算法描述了Rough集中的等价类、不可分辨关系、上下近似集、属性约简、相对属性约简等概念。

In this paper, sets are denoted by bit strings. Objects in information table are denoted by information vector. Some basic concepts such as the classes of an equivalence relation, indicernability relations, the lower approximation of a set, the upper approximation of a set and attribute reduction are described by algorithms based on the same ideas.