Attribute reduction via local conditional entropy

2019 ◽  
Vol 10 (12) ◽  
pp. 3619-3634 ◽  
Author(s):  
Yibo Wang ◽  
Xiangjian Chen ◽  
Kai Dong
2013 ◽  
Vol 380-384 ◽  
pp. 1505-1509
Author(s):  
Zhang Yan Xu ◽  
Wei Zhang ◽  
Yan Ying Fan

The search of the attribute reduction algorithm of rough set in incomplete decision table is a research hot spot. Though analysis of the advantages and disadvantages of the existing attribute reduction algorithms,we put forward a definition of relative discernibility matrix base on the positive area. Then we compute the tolerance class with the the idea of cardinal number sorting method, giving a quick heuristic algorithm of attribute reduction with theconditional entropy and relative discernibility matrix, which of the time complexity is in the worst case. The test result shows that the algorithm can obtain an attribute reduction efficiently.


2013 ◽  
Vol 347-350 ◽  
pp. 3177-3181 ◽  
Author(s):  
Gui Juan Song ◽  
Gang Li

Attribute reduction is a key problem for rough set theory. While computing reduction according to the definitions is a typical NP problem. In this paper, basic concept of rough set theory is presented, one heuristic algorithm for attribution reduction based on conditional entropy is proposed. The actual application shows that the method is feasible and effective


2014 ◽  
Vol 644-650 ◽  
pp. 1607-1619 ◽  
Author(s):  
Tao Yan ◽  
Chong Zhao Han

Z. Pawlak’s rough set theory has been widely applied in analyzing ordinary information systems and decision tables. While few studies have been conducted on attribute selection problem in incomplete decision systems because of its complexity. Therefore, it is necessary to investigate effective algorithms to tackle this issue. In this paper, In this paper, a new rough conditional entropy based uncertainty measure is introduced to evaluate the significance of subsets of attributes in incomplete decision systems. Moreover, some important properties of rough conditional entropy are derived and three attribute selection approaches are constructed, including an exhaustive approach, a heuristic approach, and a probabilistic approach. In the end, a series of experiments on practical incomplete data sets are carried out to assess the proposed approaches. The final experimental results indicate that two of these approaches perform satisfyingly in the process of attribute selection in incomplete decision systems.


Author(s):  
Shuo Feng ◽  
Haiying Chu ◽  
Xuyang Wang ◽  
Yuanka Liang ◽  
Xianwei Shi ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document