An Attribute Reduction Algorithm based on Rough Set, Information Entropy and Ant Colony optimization

Author(s):  
Guan Xin ◽  
Guo Qiang ◽  
Zhao Jing ◽  
Zhang Zheng-chao
2015 ◽  
Vol 9 (1) ◽  
pp. 2774-2779
Author(s):  
Yang Su-Min ◽  
Meng Jie ◽  
Zhang zheng-Bao ◽  
Xie Zhi-Ying

2021 ◽  
pp. 1-15
Author(s):  
Rongde Lin ◽  
Jinjin Li ◽  
Dongxiao Chen ◽  
Jianxin Huang ◽  
Yingsheng Chen

Fuzzy covering rough set model is a popular and important theoretical tool for computation of uncertainty, and provides an effective approach for attribute reduction. However, attribute reductions derived directly from fuzzy lower or upper approximations actually still occupy large of redundant information, which leads to a lower ratio of attribute-reduced. This paper introduces a kind of parametric observation sets on the approximations, and further proposes so called parametric observational-consistency, which is applied to attribute reduction in fuzzy multi-covering decision systems. Then the related discernibility matrix is developed to provide a way of attribute reduction. In addition, for multiple observational parameters, this article also introduces a recursive method to gradually construct the multiple discernibility matrix by composing the refined discernibility matrix and incremental discernibility matrix based on previous ones. In such case, an attribute reduction algorithm is proposed. Finally, experiments are used to demonstrate the feasibility and effectiveness of our proposed method.


Sign in / Sign up

Export Citation Format

Share Document