Statisticians and database users often encounter the problem of missing or imprecise data obtained by a random experiment. Such a data set is called a random incomplete information table. In this paper, we study knowledge reduction in random incomplete information tables and random incomplete decision tables by using a hybrid model based on the rough set theory and the Dempster- Shafer theory of evidence. The concepts of random belief reducts and random plausibility reducts in random incomplete information tables and random incomplete decision tables are introduced. The relationships among the lower approximation reduct, the upper approximation reduct, the random belief reduct, the random plausibility reduct, and the classical reduct in random incomplete decision tables are examined.
H. Kudo introduced a notion of convergence of a sequence Bn of sub-σ-fields. We emphasize a connection with Mosco-convergence of associated subspaces LpE (Bn) where E is a separable Banach space with separable dual. This enables us to study the convergence of conditional expectation sequences of random sets and therefore to obtain a new version of the multivalued Fatou lemma.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.