基于不分明与相似关系的Rough集的超图描述

A Hypergraph Description of Indiscernibility and Similarity Relation Based Rough Set

近些年来,尤其是进入九十年代,国内外众多学者对Rough集理论及其应用进行了深入而广泛的研究,并取得了许多重大进展。在波兰,作为Rough集理论的发源地,在Z.Pawlak教授的带领下,许多计算机和其他领域的专家、学者们先后开发出了Rough集函数库、RoughDas/RoughClass、RSES等软件支撑系统。

This paper analyses the relation between the indiscernibility and similarity relation based rough set. We present a new method, which we call hypergraph description approach, to describe the approximations of rough set. It can be used to analyze the indiscernibility and similarity relation based rough set in a more direct and convenient way. The proposed method is proved to be an efficient way to combine the rough set theory and the graph theory together.