%0 Journal Article
%T Attribute Reduction Based on Ordered Discernibility Set and Significance of Attribute<br>基于有序差别集和属性重要性的属性约简
%A ZHANG Ying-chun
%A WANG Yu-xin
%A GUO He
%A <br>张迎春
%A 王宇新
%A 郭禾
%J 计算机科学
%D 2011
%I 
%X A new improved algorithm for the simplified discernibility-matrix was proposed on the subject of attribute re- duction in rough set theory. Discernibility-matrix is being simplified without being sorted and at fewer cost of traver- sing. I}his can notably raise the speed of being simplified discernibility-matrix and ultimately obtain the ordered and sim- plified discernibility set. The comparative experiments on computational efficiency show that this new algorithm is more efficient than the homogeneous ones. A new criterion of significance of attribute was put forward based on the three as- pects which arc the weight of element containing the attribute, the frequency and the absorptive ability of the attribute in the discernibility set. Therefore a new method for attribute reduction was introduced on the basis of the above two points, the theoretical analysis proves that the worst time complexity of the new method is less than the other ones based on discernibility-matrix. In addition, lots of comparative experiments in attribute reduction display that this new method is effective and can largely find out a minimal attribute reduction.
%K Rough set
%K Attribute reduction
%K Simplified discernibifity-atrix
%K Discernibifity set
%K Significance of attribute<br>粗糙集，属性约简，简化差别矩阵，差别集，属性重要性
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=17DDCED190714E7914ACD95CAC086D49&yid=9377ED8094509821&vid=16D8618C6164A3ED&iid=F3090AE9B60B7ED1&sid=B78CD622C1934236&eid=002786F01A86D891&journal_id=1002-137X&journal_name=计算机科学&referenced_num=0&reference_num=0