摘要：Severa strategies for the minimal attribute reduction with polynomial time complexity(O(n^k)have been developed in rough set theory.Are they complete?While investigating the attribute reduction strategy based on the discernibility matrix(DM),a counterexample is constructed theoretically,which demonstrates that these strategies are all incomplete with respect to the minimal reduction.

送人玫瑰，手留余香~如您已下载到该资源，可在回帖当中上传与大家共享，欢迎来CDA社区交流学习。（仅供学术交流用。）