Computer Engineering and Applications ›› 2006, Vol. 42 ›› Issue (20): 16-.

• 博士论坛 • Previous Articles     Next Articles

The Improvement to Condition in Discernibility Function of Positive Reduct of Decision Table

Du Weifeng,   

  1. 西南交通大学智能控制开发中心
  • Received:2006-04-28 Revised:1900-01-01 Online:2006-07-11 Published:2006-07-11
  • Contact: Du Weifeng



  1. 西南交通大学智能控制开发中心
  • 通讯作者: 杜卫锋 DuWeifeng

Abstract: The paper makes improvement to the condition which the elements in discernibility matrix introduced by Skowron satify. Thus we can get two advantages: the verification to the condition is simpler; the elements satisfying the condition in discernibility matrix are less. Then the complexity of computing reduct with discernibility function decreases. Such property is effective not only to manual operation but also to computer processing. The paper is organized as follows: Firstly, the starting point of the idea in this paper is presented vividly from two facets in the positive region chart; Secondly, we give the proof to the improved condition; Lastly, we illustrate the validity of the improved condition.

Key words: decision table, reduct, discernibility matrix, discernibility function

摘要: 本文对Skowron提出的区分矩阵中元素满足的条件 作了改进,使得对条件的判断较原来更为简单,并且区分矩阵中满足该条件的元素较原来更少。这样降低了用区分函数计算约简的复杂度,对手工操作和计算机处理均较为有效。本文的安排是这样的:首先,在正域图中从两个方面直观地显示了本文思路的出发点;然后,对改进条件给出了证明;最后,用例子说明了改进条件的有效性。

关键词: 决策表, 约简, 区分矩阵, 区分函数