An Attribute Reduction Algorithm in Rough Set Theory Based on Information Entropy

Author(s):  
Cuiru Wang ◽  
Fangfang Ou
2014 ◽  
Vol 533 ◽  
pp. 237-241
Author(s):  
Xiao Jing Liu ◽  
Wei Feng Du ◽  
Xiao Min

The measure of the significance of the attribute and attribute reduction is one of the core content of rough set theory. The classical rough set model based on equivalence relation, suitable for dealing with discrete-valued attributes. Fuzzy-rough set theory, integrating fuzzy set and rough set theory together, extending equivalence relation to fuzzy relation, can deal with fuzzy-valued attributes. By analyzing three problems of FRAR which is a fuzzy decision table attribute reduction algorithm having extensive use, this paper proposes a new reduction algorithm which has better overcome the problem, can handle larger fuzzy decision table. Experimental results show that our reduction algorithm is much quicker than the FRAR algorithm.


Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-11 ◽  
Author(s):  
Tengfei Zhang ◽  
Fumin Ma ◽  
Jie Cao ◽  
Chen Peng ◽  
Dong Yue

Parallel attribute reduction is one of the most important topics in current research on rough set theory. Although some parallel algorithms were well documented, most of them are still faced with some challenges for effectively dealing with the complex heterogeneous data including categorical and numerical attributes. Aiming at this problem, a novel attribute reduction algorithm based on neighborhood multigranulation rough sets was developed to process the massive heterogeneous data in the parallel way. The MapReduce-based parallelization method for attribute reduction was proposed in the framework of neighborhood multigranulation rough sets. To improve the reduction efficiency, the hashing Map/Reduce functions were designed to speed up the positive region calculation. Thereafter, a quick parallel attribute reduction algorithm using MapReduce was developed. The effectiveness and superiority of this parallel algorithm were demonstrated by theoretical analysis and comparison experiments.


2013 ◽  
Vol 694-697 ◽  
pp. 2905-2909
Author(s):  
Hua Yan

Rough set theory has found an increasingly wide utilization since it was promoted in 1980s.And study on the application of rough set theory in every field has a great development in recent years. Application of rough set theory in attribute reduction, continuous attributes discretization, and uncertainty measuring, as well as application of information entropy in rough set theory are reviewed in this paper. What we will do next is to probe further into the application of information entropy in rough set theory.


2016 ◽  
Vol 693 ◽  
pp. 1346-1349
Author(s):  
Xiao Yu Chen ◽  
Wen Liao Du ◽  
An Sheng Li ◽  
Kun Li ◽  
Chun Hua Qian

Rough set theory is a useful tool for attribute reduction of fault diagnosis for rotating machinery, but cannot be efficiently used to sample increased areas. Aiming at the problem of incremental attribute reduction, a novel attribute reduction algorithm was put forward based on the binary resolution matrix for the two updating situations and the algorithm had a low space complex. Finally, with the fault diagnosis experiments of the bearing, the attribute reduction method was proved to be correct.


Sign in / Sign up

Export Citation Format

Share Document