| 基于闭包关系的信息系统约简研究 |
| |
| 引用本文： | 林培榕,张燕兰. 基于闭包关系的信息系统约简研究[J]. 东莞理工学院学报, 2010, 17(5): 28-31 |
| |
| 作者姓名： | 林培榕 张燕兰 |
| |
| 作者单位： | 漳州师范学院计算机科学与工程系,福建漳州,363000 |
| |
| 基金项目： | 国家自然科学基金资助项目(10671173;10571151); 福建省科技计划项目(2008F5066) |
| |
| 摘 要： | 用拓扑学中闭包这个最基本的概念来刻画协调决策信息系统的属性约简和不协调决策信息系统关于上近似的约简。在此基础上,很自然地提出一个二元关系相对于一族二元关系的闭包约简的概念,并且定义一个辨识矩阵来刻画闭包约简,给出闭包协调集的判定定理与约简方法。这些结果是协调信息系统的属性约简和不协调决策信息系统中关于上近似约简理论的自然推广。
|
| 关 键 词： | 决策协调集 上近似协调集 一般二元关系 闭包 |
Study of Relation Reduction Based on Closure of Information Systems |
| |
| LIN Pei-rong,ZHANG Yan-lan. Study of Relation Reduction Based on Closure of Information Systems[J]. Journal of Dongguan Institute of Technology, 2010, 17(5): 28-31 |
| |
| Authors: | LIN Pei-rong ZHANG Yan-lan |
| |
| Affiliation: | LIN Pei-rong ZHANG Yan-lan (Department of Computer Science , Engineering,Zhangzhou Normal University,Zhangzhou 363000,China) |
| |
| Abstract: | In this paper,the closure in topology was used to recognize attribute reduction in consistent information systems and possible reduction in inconsistent information systems.Then,based on the theory of topology, we gave the definition of closure reduction in a family of general relationsnatuarally.Also,we defined a discernibility matrixto present judgement theorem for closure consistent set. |
| |
| Keywords: | decision consistent set possible approximation consistent set binary relation closure |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
