Searching for Frequential Reducts in Decision Tables with Uncertain Objects

Authors:
Dominik Slezak
Affiliations:
-
Venue:
RSCTC '98 Proceedings of the First International Conference on Rough Sets and Current Trends in Computing
Year:
1998

Citing 3
Cited 5

Probabilistic reasoning in intelligent systems: networks of plausible inference

Probabilistic reasoning in intelligent systems: networks of plausible inference
Rough membership functions

Advances in the Dempster-Shafer theory of evidence
Rough Sets: Theoretical Aspects of Reasoning about Data

Rough Sets: Theoretical Aspects of Reasoning about Data

Certain, Generalized Decision, and Membership Distribution Reducts Versus Functional Dependencies in Incomplete Systems

RSEISP '07 Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms
Fast Discovery of Minimal Sets of Attributes Functionally Determining a Decision Attribute

RSEISP '07 Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms
FUN: Fast Discovery of Minimal Sets of Attributes Functionally Determining a Decision Attribute

Transactions on Rough Sets IX
Reducts and Constructs in Attribute Reduction

Fundamenta Informaticae - International Conference on Soft Computing and Distributed Processing (SCDP'2002)
Normalized Decision Functions and Measures for Inconsistent Decision Tables Analysis

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

We discuss an uncertainty representation based on rough membership functions in inconsistent decision tables. We propose a reasoning model for dealing with objects having probability distributions instead of concrete values on attributes. We prove discernibility characteristics for minimal boolean implicants in inconsistent decision tables with indeterministically defined objects.