New Reduction Algorithm Based on Decision Power of Decision Table
The current reduction algorithms based on rough sets still have some disadvantages.First,we indicated their limitations for reduct generation.We modified the mean decision power,and proposed to use the algebraic definition of decision power.To select optimal attribute reduction,the judgment criterion of decision with inequality was presented and some important conclusiorls were obtained.A complete algorithm for the attribute reduction was designed.Finally,through analyzing the given example,it was shown that the proposed heuristic information was better and more efficient than the others,and the presented in the paper method reduces time complexity and improves the performance.We report experimental results with several data sets from UCI repository and we compare the results with some other methods.The results prove that the proposed method is promising.
Rough set Decision table Reduction Decision power
Jiucheng Xu Lin Sun
College of Computer and Information Technology Henan Normal University,Xinxiang Henan 453007,China
国际会议
成都
英文
180-188
2008-05-17（万方平台首次上网日期，不代表论文的发表时间）