| Rough集理论在不完备信息系统中的扩充 |
| |
| 引用本文： | 王国胤.Rough集理论在不完备信息系统中的扩充[J].计算机研究与发展,2002,39(10):1238-1243. |
| |
| 作者姓名： | 王国胤 |
| |
| 作者单位： | 重庆邮电学院计算机科学与技术研究所,重庆,400065 |
| |
| 基金项目： | 国家自然科学基金 ( 6 980 30 1 4)，科技部攀登——特别支持费，教育部高等学校骨干教师资助计划 ( GG- 52 0 - 1 0 6 1 7- 1 0 0 1 )，教育部留学回国人员科研启动基金，重庆市应用基础研究基金资助 |
| |
| 摘 要： | Pawlak教授所提出的经典Rough集理论主要是针对完备信息系统的，利用了不可分辨关系这种等价关系来对对象进行了近拟和下近似分类，对于不完备信息系统的处理，需要对经典Rough集理论进行扩充，主要是对不可分辨关系进行扩充，目前已经有了基于容差关系，相似关系和量化容差关系等的扩充Rough集理论，但是，这些扩充也还存在一些局限性，将提出一种基于限制容差关系的扩充Rough集模型，并比较分析这些扩充Rough集模型之间的性能。
|
| 关 键 词： | Rough集理论 不完备信息系统 不可分辨关系 容差关系 相似关系 量化容差关系 限制容差关系 知识获取 |
EXTENSION OF ROUGH SET UNDER INCOMPLETE INFORMATION SYSTEMS |
| |
| WANG Guo-Yin.EXTENSION OF ROUGH SET UNDER INCOMPLETE INFORMATION SYSTEMS[J].Journal of Computer Research and Development,2002,39(10):1238-1243. |
| |
| Authors: | WANG Guo-Yin |
| |
| Abstract: | The classical rough set theory developed by professor Pawlak is based on complete information systems. It classifies objects using upper-approximation and lower-approximation defined on an indiscernibility relation that is a kind of equivalent relation. In order to process incomplete information systems, the classical rough set theory needs to be extended, especially, the indiscernibility relation needs to be extended to some inequivalent relation. There are several extensions for the indiscernibility relation now, such as tolerance relation, non-symmetric similarity relation, and valued tolerance relation. Unfortunately, these extensions have their own limitation. Presented in this paper is a new extension of rough set based on limited tolerance relation. The performances of these extended rough set models are also compared. |
| |
| Keywords: | rough set indiscernibility relation tolerance relation similarity relation valued tolerance relation limited tolerance relation |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
