| Rough集理论中几个基本概念的算法描述 |
| |
| 引用本文： | 彭思维,郭景峰,李海涛.Rough集理论中几个基本概念的算法描述[J].燕山大学学报,2006,30(1):84-86. |
| |
| 作者姓名： | 彭思维 郭景峰 李海涛 |
| |
| 作者单位： | 燕山大学,信息科学与工程学院,河北,秦皇岛,066004 |
| |
| 摘 要： | 用信息向量表示信息表知识表达系统中的埘象，基于同一思想用算法描述了Rough集中的等价类、不可分辨关系、上下近似集、属性约简、相对属性约简等概念。
|
| 关 键 词： | Rough集 属性约简 |
| 文章编号： | 1007-791X(2006)01-0084-03 |
| 修稿时间： | 2005年5月18日 |
Algorithms of several basic concepts in Rough set theory |
| |
| PENG Si-wei,GUO Jing-feng,LI Hai-tao.Algorithms of several basic concepts in Rough set theory[J].Journal of Yanshan University,2006,30(1):84-86. |
| |
| Authors: | PENG Si-wei GUO Jing-feng LI Hai-tao |
| |
| Abstract: | 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. |
| |
| Keywords: | Rough sets attribute reduction |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
