作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2007, Vol. 33 ›› Issue (16): 193-195. doi: 10.3969/j.issn.1000-3428.2007.16.068

• 人工智能及识别技术 • 上一篇    下一篇

基于二进制的Rough集决策表约简

陈 炼1,邓少波2,万 芳3,黎 敏2,刘 清1   

  1. (1. 南昌大学信息工程学院,南昌330029;2. 南昌工程学院计算机科学与技术系,南昌330099; 3. 江西师范大学计算机信息工程学院,南昌330027)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2007-08-20 发布日期:2007-08-20

Decision Tables Simplification on Rough Set Based on Binary Scale

CHEN Lian1, DENG Shao-bo2, WAN Fang3, LI Min2, LIU Qing1   

  1. (1. School of Information Engineering, Nanchang University, Nanchang 330029; 2. Department of Computer Science and Technology, Nanchang Institute of Technology, Nanchang 330099; 3. School of Computer Information Engineering, Jiangxi Normal University, Nanchang 330027)
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-08-20 Published:2007-08-20

摘要: 基于属性约简的分明矩阵方法的思想,该文提出了Rough集不可分明属性模式和属性关系的概念,给出了基于二进制的条件属性约简和属性值约简方法,结果说明,该方法比传统的Rough集理论中的方法更简便、快捷。

关键词: Rough集理论, 分明矩阵, 二进制

Abstract: The article proposes a Rough set concept of impartibility pattern of the properties and their relationships, which is based on the theory of properties reduction by use of the method of matrixs. The article presents a method of condition property and values of the property reduction. Experimental results show that the method is easier and quicker than the traditional one of rough set.

Key words: Rough set theory, discernibility matrix, binary scale

中图分类号: