Rough Sets and Rule Induction from Indiscernibility Relations Based on Possible World Semantics in Incomplete Information Systems with Continuous Domains

Author(s):  
Michinori Nakata ◽  
Hiroshi Sakai ◽  
Keitarou Hara
2021 ◽  
pp. 1-13
Author(s):  
Jing Pang ◽  
Bingxue Yao ◽  
Lingqiang Li

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.


Author(s):  
JUNHONG WANG ◽  
JIYE LIANG ◽  
YUHUA QIAN ◽  
CHUANGYIN DANG

Rough set theory is a relatively new mathematical tool for computer applications in circumstances characterized by vagueness and uncertainty. In this paper, we address uncertainty of rough sets for incomplete information systems. An axiom definition of knowledge granulation for incomplete information systems is obtained, under which a measure of uncertainty of a rough set is proposed. This measure has some nice properties such as equivalence, maximum and minimum. Furthermore, we prove that the uncertainty measure is effective and suitable for measuring roughness and accuracy of rough sets for incomplete information systems.


Sign in / Sign up

Export Citation Format

Share Document