| 张大勇,张兆心,李乔.基于广义粗糙集的知识约简方法研究[J].高技术通讯(中文),2010,20(4):366~370 |
| 基于广义粗糙集的知识约简方法研究 |
| A method of knowledge reduction based on generalized rough sets |
| |
| DOI： |
| 中文关键词: 知识约简,广义粗糙集,二元关系,判定定理 |
| 英文关键词: knowledge reduction, generalized rough sets, binary relations, decision theorem |
| 基金项目:全国高校博士点基金(No. 20070213008)，教育部社科基金(No.07JC630027)和中国博士后基金(No. 20080440856)资助项目 |
| 作者 | 单位 | | 张大勇 | 哈尔滨工业大学计算机科学与技术学院 | | 张兆心 | 哈尔滨工业大学计算机科学与技术学院 | | 李乔 | 哈尔滨工业大学计算机科学与技术学院 |
|
| 摘要点击次数: 2953 |
| 全文下载次数: 2313 |
| 中文摘要: |
| 针对粗糙集理论在知识约简中的实际需要，提出了建立在一般二元关系基础上的广义粗糙集知识约简方法。首先证明了广义粗糙集是经典粗糙集的一般性推广，而经典粗糙集是广义粗糙集的特例；然后以一般二元关系为分类基础，给出一般关系决策系统中的知识约简判定定理和辨识矩阵；最后根据实例提取最小的属性集，验证了该方法的实用性。该方法摆脱了二元等价关系对经典粗糙集的困扰，既保证了粗糙集理论在知识发现研究中的理论优势，又拓展了粗糙集理论在实际应用中的适用范围，具有较强的实用性。 |
| 英文摘要: |
| To meet the practical demand of the rough set theory in knowledge reduction, the paper establishes a method of knowledge reduction based on generalized rough sets. Firstly, the paper proves that an important value of generalized rough sets is based on arbitrary binary relations on a universal set, which may extend applications of the classical rough set theory, and then presents the decision theorem of knowledge reduction and discernible matrix based on some general binary relations. Finally, the validity of the method is verified by the application of a practical knowledge system, which can accurately abstract a minimal attribute set. The major contributions of this paper are the method of knowledge reduction based on generalized rough sets may overcome the shortage of the classical rough set theory, and extend many practical applications in various areas. |
|
查看全文
查看/发表评论 下载PDF阅读器 |
| 关闭 |
|
|
|
