scholarly journals Extended Tolerance Relation to Define a New Rough Set Model in Incomplete Information Systems

2013 ◽  
Vol 2013 ◽  
pp. 1-10 ◽  
Author(s):  
Do Van Nguyen ◽  
Koichi Yamada ◽  
Muneyuki Unehara
Keyword(s):  
Information System ◽  
Information Systems ◽  
Incomplete Information ◽  
Rough Set ◽  
Incomplete Information System ◽  
Tolerance Relation ◽  
The Core ◽  
Mathematical Properties ◽  
Incomplete Information Systems

This paper discusses and proposes a rough set model for an incomplete information system, which defines an extended tolerance relation using frequency of attribute values in such a system. It first discusses some rough set extensions in incomplete information systems. Next, “probability of matching” is defined from data in information systems and then measures the degree of tolerance. Consequently, a rough set model is developed using a tolerance relation defined with a threshold. The paper discusses the mathematical properties of the newly developed rough set model and also introduces a method to derive reducts and the core.

Generalized neighborhood systems-based pessimistic rough sets and their applications in incomplete information systems

2021 ◽  
pp. 1-13
Author(s):  
Jing Pang ◽  
Bingxue Yao ◽  
Lingqiang Li
Keyword(s):  
Information System ◽  
Information Systems ◽  
Incomplete Information ◽  
Rough Set ◽  
Rough Sets ◽  
Decision Model ◽  
Incomplete Information System ◽  
Basic Properties ◽  
Model Based ◽  
Incomplete Information Systems

In this paper, we point out that Lin’s general neighborhood systems-based rough set model is an extension of Qian’s optimistic rough set model, and thus called optimistic general neighborhood systmes-based rough set model. Then we present a new rough set model based on general neighborhood systems, and prove that it is an extension of Qian’s pessimistic rough set model. Later, we study the basic properties of the proposed pessimistic rough sets, and define the serial, reflexive, symmetric, transitive and Euclidean conditions for general neighborhood systems, and explore the further properties of related rough sets. Furthermore, we apply the pessimistic general neighborhood systems-based rough set model in the research of incomplete information system, and build a three-way decision model based on it. A simple practical example to show the effectiveness of our model is also presented.

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.

scholarly journals Fuzzy Set-Valued Information Systems and the Algorithm of Filling Missing Values for Incomplete Information Systems

Complexity ◽  
2019 ◽  
Vol 2019 ◽  
pp. 1-17
Author(s):  
Zhaohao Wang ◽  
Xiaoping Zhang
Keyword(s):  
Information System ◽  
Information Systems ◽  
Incomplete Information ◽  
Rough Set ◽  
Fuzzy Set ◽  
Missing Values ◽  
Rough Set Theory ◽  
Similarity Measures ◽  
New Information ◽  
Incomplete Information Systems

How to effectively deal with missing values in incomplete information systems (IISs) according to the research target is still a key issue for investigating IISs. If the missing values in IISs are not handled properly, they will destroy the internal connection of data and reduce the efficiency of data usage. In this paper, in order to establish effective methods for filling missing values, we propose a new information system, namely, a fuzzy set-valued information system (FSvIS). By means of the similarity measures of fuzzy sets, we obtain several binary relations in FSvISs, and we investigate the relationship among them. This is a foundation for the researches on FSvISs in terms of rough set approach. Then, we provide an algorithm to fill the missing values in IISs with fuzzy set values. In fact, this algorithm can transform an IIS into an FSvIS. Furthermore, we also construct an algorithm to fill the missing values in IISs with set values (or real values). The effectiveness of these algorithms is analyzed. The results showed that the proposed algorithms achieve higher correct rate than traditional algorithms, and they have good stability. Finally, we discuss the importance of these algorithms for investigating IISs from the viewpoint of rough set theory.

A NEW METHOD FOR MEASURING THE UNCERTAINTY IN INCOMPLETE INFORMATION SYSTEMS

2009 ◽  
Vol 17 (06) ◽  
pp. 855-880 ◽  
Author(s):  
YUHUA QIAN ◽  
JIYE LIANG ◽  
FENG WANG
Keyword(s):  
Information System ◽  
Information Systems ◽  
Incomplete Information ◽  
Information Gain ◽  
Incomplete Information System ◽  
Uncertainty Measurement ◽  
Nature Of Information ◽  
Knowledge Content ◽  
Incomplete Information Systems ◽  
The Relationship

Based on an intuitionistic knowledge content nature of information gain, the concept of combination entropy CE(A) in incomplete information systems is first introduced, and some of its important properties are given. Then, the conditional combination entropy CE(Q | P) and the mutual information CE(P;Q) are defined. Unlike all existing measures for the uncertainty in incomplete information systems, the relationships among these three concepts can be established, which are formally expressed as CE(Q | P) = CE(P ⋃ Q)-CE(P) and CE(P;Q) = CE(P)-CE(P | Q). Furthermore, a variant CE(CA) of the combination entropy with maximal consistent block nature is introduced to measure the uncertainty of an incomplete information system in the view of maximal consistent block technique. Its monotonicity is the same as that of the combination entropy. Finally, the combination granulation CG(A) and its variant CG(CA) with maximal consistent block nature are defined to measure discernibility ability of an incomplete information system, and the relationship between the combination entropy and the combination granulation is established as well. These results will be very helpful for understanding the essence of knowledge content and uncertainty measurement in incomplete information systems. Note that the combination entropy also can be further extended to measure the uncertainty in non-equivalence-based information systems.

Sign in / Sign up

Export Citation Format

Share Document