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

计算机工程 ›› 2009, Vol. 35 ›› Issue (15): 67-69,7. doi: 10.3969/j.issn.1000-3428.2009.15.023

• 软件技术与数据库 • 上一篇    下一篇

一种粗糙集属性约简算法

庄静芸1,徐中伟1,喻 钢1,2   

  1. (1. 同济大学电子与信息工程学院,上海 201804;2. 上海大学悉尼工商学院,上海201800)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2009-08-05 发布日期:2009-08-05

Attribute Reduction Algorithm Using Rough Sets

ZHUANG Jing-yun1, XU Zhong-wei1, YU Gang1,2   

  1. (1. School of Electronics and Information, Tongji University, Shanghai 201804; 2. Sydney Institute of Language and Commerce, Shanghai University, Shanghai 201800)
  • Received:1900-01-01 Revised:1900-01-01 Online:2009-08-05 Published:2009-08-05

摘要: 基于粗糙集理论提出一种新的属性重要度的度量方法,引入决策强度的概念,克服经典粗糙集理论约简定义的不完备性及无法获得最优属性约简的缺陷,改进基于信息熵的启发式属性约简算法,通过对既有线CTCS-2级车站列控中心软件测试平台的测试数据的实证分析,成功获得最优属性约简,发现数据之间的潜在联系及规律,给出决策规则,使决策分析更为高效。

关键词: 粗糙集, 信息熵, 约简, 决策规则

Abstract: In order to overcome the incompleteness of reduction definition in classical rough sets theory and no avail of getting the optimal attribute reduction, a new measure of attribute significance is put forward and a concept of decision power is introduced. Accordingly, an improved heuristic algorithm for attribute reduction based on information entropy is proposed. It is analyzed in theory and tested in practice. By means of the test data analysis on CTCS-2 train control center software test platform, the optimal attribute reduction can be successfully obtained by the algorithm, latent relations and rules are also discovered and decision rules are given. It contributes a lot to make more effective decision analysis.

Key words: rough sets, information entropy, reduction, decision rule

中图分类号: