Improvement of decision table attribute reduction algorithm based on Discernibility Matrix

Author(s):  
Daoguo Li ◽  
Hualong Ma ◽  
Yiqi Yin
2012 ◽  
Vol 457-458 ◽  
pp. 1230-1234 ◽  
Author(s):  
Ying He ◽  
Dan He

A discernibility matrix-based attribute reduction algorithm of decision table is introduced in this paper, which takes the importance of attributes as the heuristic message. This method solves the problem of the attribute selection when the frequencies of decision table attributes are equal. The result shows that this method can give out simple but effective method of attribute reduction.


2011 ◽  
Vol 480-481 ◽  
pp. 1613-1617
Author(s):  
Ying He ◽  
Dan He

A binary discernibility matrix attribute reduction algorithm of incomplete decision table is introduced in this paper, which takes the importance of attribute as the heuristic message. To obtain better attribute reduction, this paper constructs a metric formula of attribute importance and gives a binary discernibility matrix to present incomplete decision table. Based on the formula and matrix an attribute reduction algorithm of incomplete decision table is introduced. This algorithm solves the problem of the attribute selection when the frequencies of attributes are equal. The result shows that this method is simple and effective.


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

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.


2014 ◽  
Vol 556-562 ◽  
pp. 4820-4824
Author(s):  
Ying Xia ◽  
Le Mi ◽  
Hae Young Bae

In study of image affective semantic classification, one problem is the low classification accuracy caused by low-level redundant features. To eliminate the redundancy, a novel image affective classification method based on attributes reduction is proposed. In this method, a decision table is built from the extraction of image features first. And then valid low-level features are determined through the feature selection process using the rough set attribute reduction algorithm. Finally, the semantic recognition is done using SVM. Experiment results show that the proposed method improves the accuracy in image affective semantic classification significantly.


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.


Sign in / Sign up

Export Citation Format

Share Document