A Semantical Approach to Rough Sets and Dominance-Based Rough Sets

@inproceedings{Deer2016ASA,
  title={A Semantical Approach to Rough Sets and Dominance-Based Rough Sets},
  author={Lynn D'eer and Chris Cornelis and Yiyu Yao},
  booktitle={IPMU},
  year={2016}
}
There exist two formulations of rough sets: the conceptual and computational one. The conceptual or semantical approach of rough set theory focuses on the meaning and interpretation of concepts, while algorithms to compute those concepts are studied in the computational formulation. However, the research on the former is rather limited. In this paper, we focus on a semantically sound approach of Pawlak’s rough set model and covering-based rough set models. Furthermore, we illustrate that the… 

A semantical and computational approach to covering-based rough sets

R rough set models are designed to process qualitative or discrete data products, and many authors have generalized Pawlak’s model by using binary non-equivalence relations, neighborhood operators and coverings.

Dominance Lagrange Optimized Rule Generation for Decision Table Evaluation

A Dominance Principle-based Reduct with Dominance Lagrange Optimized Rule Generation (DLO-RG) model is proposed for the analysis of obtained decision rule set, proving the rules framed by the DLO-RG are more significant when compared with that of rules from existing methods.

References

SHOWING 1-10 OF 38 REFERENCES

Properties of the First Type of Covering-Based Rough Sets

  • William ZhuFei-Yue Wang
  • Computer Science
    Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06)
  • 2006
This paper studies covering-based generalized rough sets, where a covering can also generate a lower approximation operation and an upper approximation operation, but some of common properties of classical lower and upper approximation operations are no longer satisfied.

Properties of the Third Type of Covering-Based Rough Sets

  • W. ZhuFei-Yue Wang
  • Computer Science
    2007 International Conference on Machine Learning and Cybernetics
  • 2007
This paper studies covering-based generalized rough sets, in which a covering can generate a lower approximation operation and an upper approximation operation, but some of common properties of classical lower and upper approximation operations are no longer satisfied.

The two sides of the theory of rough sets

  • Yiyu Yao
  • Philosophy
    Knowl. Based Syst.
  • 2015

On the upper approximations of covering generalized rough sets

This work improves the definition of upper approximation for covering generalized rough sets to make it more reasonable than the existing ones, and sets up a framework for the approximation operators of covering rough sets.

A Generalized Definition of Rough Approximations Based on Similarity

New definitions of lower and upper approximations are proposed, which are basic concepts of the rough set theory and are shown to be more general, in the sense that they are the only ones which can be used for any type of indiscernibility or similarity relation.

A New Type of Covering Rough Set

  • W. ZhuFei-Yue Wang
  • Computer Science
    2006 3rd International IEEE Conference Intelligent Systems
  • 2006
The inter dependency between the lower and the upper approximation operations, conditions under which two coverings generate a same upper approximation operation, and the axiomatic systems for these operations are explored.

Set-theoretic Approaches to Granular Computing

The notion of approximations is examined based on granular structures, and a framework for studying a particular class of set-theoretic approaches to granular computing is proposed.

On Three Types of Covering-Based Rough Sets

Three kinds of covering generalized rough sets for dealing with the vagueness and granularity in information systems are studied and the relationships among these three types of covering rough sets are explored.

Relationship between generalized rough sets based on binary relation and covering