A New Type of Covering Rough Set

2006 ◽  
Author(s):  
William Zhu ◽  
Fei-Yue Wang
Keyword(s):  
Rough Set ◽  
New Type ◽  
Covering Rough Set

scholarly journals A New Type of Single Valued Neutrosophic Covering Rough Set Model

Symmetry ◽  
2019 ◽  
Vol 11 (9) ◽  
pp. 1074
Author(s):  
Jingqian Wang ◽  
Xiaohong Zhang
Keyword(s):  
Decision Making ◽  
Rough Set ◽  
Inclusion Relation ◽  
Approximation Space ◽  
Matrix Representations ◽  
Model Based ◽  
Approximation Operators ◽  
New Type ◽  
Novel Method ◽  
Covering Rough Set

Recently, various types of single valued neutrosophic (SVN) rough set models were presented based on the same inclusion relation. However, there is another SVN inclusion relation in SVN sets. In this paper, we propose a new type of SVN covering rough set model based on the new inclusion relation. Furthermore, the graph and matrix representations of the new SVN covering approximation operators are presented. Firstly, the notion of SVN β 2 -covering approximation space is proposed, which is decided by the new inclusion relation. Then, a type of SVN covering rough set model under the SVN β 2 -covering approximation space is presented. Moreover, there is a corresponding SVN relation rough set model based on a SVN relation induced by the SVN β 2 -covering, and two conditions under which the SVN β 2 -covering can induce a symmetric SVN relation are presented. Thirdly, the graph and matrix representations of the new SVN covering rough set model are investigated. Finally, we propose a novel method for decision making (DM) problems in paper defect diagnosis under the new SVN covering rough set model.

scholarly journals Intuitionistic L-fuzzy β-covering Rough Set

2021 ◽  
pp. 1-19
Author(s):  
Peng Yu ◽  
Xiao-gang An ◽  
Xiao-hong Zhang
Keyword(s):  
Rough Set ◽  
Covering Rough Set

Attribute reduction in fuzzy multi-covering decision systems via observational- consistency and fuzzy discernibility

2021 ◽  
pp. 1-15
Author(s):  
Rongde Lin ◽  
Jinjin Li ◽  
Dongxiao Chen ◽  
Jianxin Huang ◽  
Yingsheng Chen
Keyword(s):  
Rough Set ◽  
Attribute Reduction ◽  
Recursive Method ◽  
Redundant Information ◽  
Reduction Algorithm ◽  
Discernibility Matrix ◽  
Decision Systems ◽  
Theoretical Tool ◽  
Lower Ratio ◽  
Covering Rough Set

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.

scholarly journals Attribute Reduction Based on Consistent Covering Rough Set and Its Application

Complexity ◽  
2017 ◽  
Vol 2017 ◽  
pp. 1-9 ◽  
Author(s):  
Jianchuan Bai ◽  
Kewen Xia ◽  
Yongliang Lin ◽  
Panpan Wu
Keyword(s):  
Set Theory ◽  
Rough Set ◽  
Rough Set Theory ◽  
Attribute Reduction ◽  
Relevance Vector Machine ◽  
Support Vector ◽  
Processing Step ◽  
Important Processing ◽  
Continuous Attribute ◽  
Covering Rough Set

As an important processing step for rough set theory, attribute reduction aims at eliminating data redundancy and drawing useful information. Covering rough set, as a generalization of classical rough set theory, has attracted wide attention on both theory and application. By using the covering rough set, the process of continuous attribute discretization can be avoided. Firstly, this paper focuses on consistent covering rough set and reviews some basic concepts in consistent covering rough set theory. Then, we establish the model of attribute reduction and elaborate the steps of attribute reduction based on consistent covering rough set. Finally, we apply the studied method to actual lagging data. It can be proved that our method is feasible and the reduction results are recognized by Least Squares Support Vector Machine (LS-SVM) and Relevance Vector Machine (RVM). Furthermore, the recognition results are consistent with the actual test results of a gas well, which verifies the effectiveness and efficiency of the presented method.

scholarly journals Fuzzy covering-based rough set on two different universes and its application

2021 ◽  
Author(s):  
Bin Yang
Keyword(s):  
Decision Making ◽  
Rough Set ◽  
Multiple Criteria Decision Making ◽  
Multiple Criteria ◽  
Extension Principle ◽  
Upper Approximation ◽  
New Type ◽  
New Perspective ◽  
Definition Of ◽  
Two Universes

Abstract In this paper, we propose a new type of fuzzy covering-based rough set model over two different universes by using Zadeh’s extension principle. We mainly address the following issues in this paper. First, we present the definition of fuzzy β-neighborhood, which can be seen as a fuzzy mapping from a universe to the set of fuzzy sets on another universe and study its properties. Then we define a new type of fuzzy covering-based rough set model on two different universes and investigate the properties of this model. Meanwhile, we give a necessary and sufficient condition under which two fuzzy β-coverings to generate the same fuzzy covering lower approximation or the same fuzzy covering upper approximation. Moreover, matrix representations of thefuzzy covering lower and fuzzy covering upper approximation operators are investigated. Finally, we propose a new approach to a kind of multiple criteria decision making problem based on fuzzy covering-based rough set model over two universes. The proposed models not onlyenrich the theory of fuzzy covering-based rough set but also provide a new perspective for multiple criteria decision making with uncertainty.

scholarly journals Two Types of Intuitionistic Fuzzy Covering Rough Sets and an Application to Multiple Criteria Group Decision Making

Symmetry ◽  
2018 ◽  
Vol 10 (10) ◽  
pp. 462 ◽  
Author(s):  
Jingqian Wang ◽  
Xiaohong Zhang
Keyword(s):  
Decision Making ◽  
Rough Set ◽  
Group Decision Making ◽  
Rough Sets ◽  
Group Decision ◽  
Multiple Criteria ◽  
Approximation Spaces ◽  
Intuitionistic Fuzzy ◽  
Definition Of ◽  
Covering Rough Set

Intuitionistic fuzzy rough sets are constructed by combining intuitionistic fuzzy sets with rough sets. Recently, Huang et al. proposed the definition of an intuitionistic fuzzy (IF) β -covering and an IF covering rough set model. In this paper, some properties of IF β -covering approximation spaces and the IF covering rough set model are investigated further. Moreover, we present a novel methodology to the problem of multiple criteria group decision making. Firstly, some new notions and properties of IF β -covering approximation spaces are proposed. Secondly, we study the characterizations of Huang et al.’s IF covering rough set model and present a new IF covering rough set model for crisp sets in an IF environment. The relationships between these two IF covering rough set models and some other rough set models are investigated. Finally, based on the IF covering rough set model, Huang et al. also defined an optimistic multi-granulation IF rough set model. We present a novel method to multiple criteria group decision making problems under the optimistic multi-granulation IF rough set model.

Sign in / Sign up

Export Citation Format

Share Document