Improvement to the Criterion ω(x,y) in Positive Reduct of Decision Table
The paper makes improvement to the condition ω(x, y) which the elements in discernibility matrix introduced by Skowron satisfy. 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.
decision table reduct discernibility matrix discernibility function
Gao Yan Du Weifeng Qin Keyun Wang Fuli
College of Computer Science & Technology, Henan Polytechnic University, Jiaozuo, Henan Province, Chi School of Information Science & Technology, Southwest Jiaotong University, Chengdu, Sichuan Province
国际会议
2006 IEEE International Conference on Information Acquisition
山东威海
英文
781-785
2006-08-20(万方平台首次上网日期,不代表论文的发表时间)