scholarly journals Reasoning on vague ontologies using rough set theory

2021 ◽  
Vol 7 (1) ◽  
pp. 0-0
Keyword(s):  
Incomplete Information ◽  
Set Theory ◽  
Rough Set ◽  
Rough Set Theory ◽  
Approximation Spaces ◽  
Automatic Reasoning ◽  
Fuzzy Concept ◽  
Open World ◽  
Tableau Algorithm ◽  
Open World Assumption

Web ontologies can contain vague concepts, which means the knowledge about them is imprecise and then query answering will not possible due to the open world assumption. A concept description can be very exact (crisp concept) or exact (fuzzy concept) if its knowledge is complete, otherwise it is inexact (vague concept) if its knowledge is incomplete. In this paper, we propose a method based on the rough set theory for reasoning on vague ontologies. With this method, the detection of vague concepts will insert into the original ontology new rough vague concepts where their description is defined on approximation spaces to be used by extended Tableau algorithm for automatic reasoning. The extended Tableau algorithm by this rough set-based vagueness is intended to answer queries even with the presence of incomplete information.

THE ALGORITHM ON KNOWLEDGE REDUCTION IN INCOMPLETE INFORMATION SYSTEMS

2002 ◽  
Vol 10 (01) ◽  
pp. 95-103 ◽  
Author(s):  
JIYE LIANG ◽  
ZONGBEN XU
Keyword(s):  
Information System ◽  
Information Systems ◽  
Incomplete Information ◽  
Set Theory ◽  
Rough Set ◽  
Rough Set Theory ◽  
Np Hard ◽  
Knowledge Reduction ◽  
Np Hard Problem ◽  
Incomplete Information Systems

Rough set theory is emerging as a powerful tool for reasoning about data, knowledge reduction is one of the important topics in the research on rough set theory. It has been proven that finding the minimal reduct of an information system is a NP-hard problem, so is finding the minimal reduct of an incomplete information system. Main reason of causing NP-hard is combination problem of attributes. In this paper, knowledge reduction is defined from the view of information, a heuristic algorithm based on rough entropy for knowledge reduction is proposed in incomplete information systems, the time complexity of this algorithm is O(|A|2|U|). An illustrative example is provided that shows the application potential of the algorithm.

Similarity measure for multi-granularity rough approximations of vague sets

2021 ◽  
Vol 40 (1) ◽  
pp. 1609-1621
Author(s):  
Jie Yang ◽  
Wei Zhou ◽  
Shuai Li
Keyword(s):  
Set Theory ◽  
Rough Set ◽  
Rough Set Theory ◽  
Target Concept ◽  
Uncertainty Measure ◽  
Approximation Spaces ◽  
Vague Sets ◽  
Rough Approximation ◽  
Vague Concept

Vague sets are a further extension of fuzzy sets. In rough set theory, target concept can be characterized by different rough approximation spaces when it is a vague concept. The uncertainty measure of vague sets in rough approximation spaces is an important issue. If the uncertainty measure is not accurate enough, different rough approximation spaces of a vague concept may possess the same result, which makes it impossible to distinguish these approximation spaces for charactering a vague concept strictly. In this paper, this problem will be solved from the perspective of similarity. Firstly, based on the similarity between vague information granules(VIGs), we proposed an uncertainty measure with strong distinguishing ability called rough vague similarity (RVS). Furthermore, by studying the multi-granularity rough approximations of a vague concept, we reveal the change rules of RVS with the changing granularities and conclude that the RVS between any two rough approximation spaces can degenerate to granularity measure and information measure. Finally, a case study and related experiments are listed to verify that RVS possesses a better performance for reflecting differences among rough approximation spaces for describing a vague concept.

scholarly journals Idealization of j-approximation spaces

Filomat ◽  
2020 ◽  
Vol 34 (2) ◽  
pp. 287-301
Author(s):  
Mona Hosny
Keyword(s):  
Set Theory ◽  
Rough Set ◽  
Rough Set Theory ◽  
Current Work ◽  
Core Concept ◽  
Approximation Spaces ◽  
Lower Approximation ◽  
Upper Approximation ◽  
Generalized Rough Set ◽  
The Ideal

The current work concentrates on generating different topologies by using the concept of the ideal. These topologies are used to make more thorough studies on generalized rough set theory. The rough set theory was first proposed by Pawlak in 1982. Its core concept is upper and lower approximations. The principal goal of the rough set theory is reducing the vagueness of a concept to uncertainty areas at their borders by increasing the lower approximation and decreasing the upper approximation. For the mentioned goal, different methods based on ideals are proposed to achieve this aim. These methods are more accurate than the previous methods. Hence it is very interesting in rough set context for removing the vagueness (uncertainty).

On modeling similarity and three-way decision under incomplete information in rough set theory

2020 ◽  
Vol 191 ◽  
pp. 105251 ◽  
Author(s):  
Junfang Luo ◽  
Hamido Fujita ◽  
Yiyu Yao ◽  
Keyun Qin
Keyword(s):  
Incomplete Information ◽  
Set Theory ◽  
Rough Set ◽  
Rough Set Theory

scholarly journals Rough Set Extension under Incomplete Information System with “?” Values

2018 ◽  
Vol 2 (1) ◽  
Author(s):  
Ahmed Hamed Hussein
Keyword(s):  
Information System ◽  
Incomplete Information ◽  
Set Theory ◽  
Rough Set ◽  
Rough Set Theory ◽  
Extended Model ◽  
Approximation Accuracy ◽  
Incomplete Information System ◽  
Similarity Class ◽  
Indiscernible Objects

Classical rough set theory (RST) can't process incomplete information system (IIS) because it is based on an indiscernibility relation which is a kind of equivalent relation. In the literature a non-symmetric similarity relation based rough set model (NS-RSM) has been introduced as an extended model under IIS with ``?" values directly. Unfortunately, in this model objects in the same similarity class are not necessarily similar to each other and may belong to different target classes. In this paper, a new inequivalent relation called Maximal Limited Consistent block relation (MLC) is proposed. The proposed MLC relation improves the lower approximation accuracy by finding the maximal limited blocks of indiscernible objects in IIS with ``?" values. Maximal Limited Similarity rough set model (MLS) is introduced as an integration between our proposed relation (MLC) and NS-RSM. The resulted MLS model works efficiently under IIS with ``?" values. Finally, an illustrative example is given to validate MLS model. Furthermore, approximation accuracy comparisons have been conducted among NS-RSM and MLS. The results of this work demonstrate that the MLS model outperform NS-RSM.

A comparison of two types of rough approximations based on Nj-neighborhoods

2021 ◽  
pp. 1-14
Author(s):  
Tareq M. Al-Shami ◽  
Ibtesam Alshammari ◽  
Mohammed E. El-Shafei
Keyword(s):  
Topological Space ◽  
Set Theory ◽  
Rough Set ◽  
Rough Sets ◽  
Rough Set Theory ◽  
Mathematical Tool ◽  
Approximation Spaces ◽  
Uncertain Knowledge ◽  
Accuracy Measures

In 1982, Pawlak proposed the concept of rough sets as a novel mathematical tool to address the issues of vagueness and uncertain knowledge. Topological concepts and results are close to the concepts and results in rough set theory; therefore, some researchers have investigated topological aspects and their applications in rough set theory. In this discussion, we study further properties of Nj-neighborhoods; especially, those are related to a topological space. Then, we define new kinds of approximation spaces and establish main properties. Finally, we make some comparisons of the approximations and accuracy measures introduced herein and their counterparts induced from interior and closure topological operators and E-neighborhoods.

scholarly journals Multiset concepts in two-universe approximation spaces

2020 ◽  
Vol 28 (1) ◽  
Author(s):  
O. A. Embaby ◽  
Nadya A. Toumi
Keyword(s):  
Decision Making ◽  
Information Systems ◽  
Set Theory ◽  
Rough Set ◽  
Rough Set Theory ◽  
Approximation Space ◽  
Approximation Spaces ◽  
Lower And Upper Approximations ◽  
Two Universes ◽  
Basic Sets

Abstract Rough set theory over two universes is a generalization of rough set model to find accurate approximations for uncertain concepts in information systems in which uncertainty arises from existence of interrelations between the three basic sets: objects, attributes, and decisions. In this work, multisets are approximated in a crisp two-universe approximation space using binary ordinary relation and multi relation. The concept of two universe approximation is applied for defining lower and upper approximations of multisets. Properties of these approximations are investigated, and the deviations between them and corresponding notions are obtained; some counter examples are given. The suggested notions can help in the modification of the decision-making for events in which objects have repetitions such as patients visiting a doctor more than one time; an example for this case is given.

Sign in / Sign up

Export Citation Format

Share Document