Application of Discernibility Tables to Calculation of Approximate Frequency Based Reducts

Authors:
Maciej Borkowski;Dominik Slezak
Affiliations:
-;-
Venue:
RSCTC '00 Revised Papers from the Second International Conference on Rough Sets and Current Trends in Computing
Year:
2000

Citing 8
Cited 0

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
Various approaches to reasoning with frequency based decision reducts: a survey

Rough set methods and applications
Rough Sets: Theoretical Aspects of Reasoning about Data

Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets in Knowledge Discovery 2: Applications, Case Studies, and Software Systems

Rough Sets in Knowledge Discovery 2: Applications, Case Studies, and Software Systems
Boolean Reasoning for Decision Rules Generation

ISMIS '93 Proceedings of the 7th International Symposium on Methodologies for Intelligent Systems
Decision Rules, Bayes' Rule and Ruogh Sets

RSFDGrC '99 Proceedings of the 7th International Workshop on New Directions in Rough Sets, Data Mining, and Granular-Soft Computing
Decision Making with Probabilistic Decision Tables

RSFDGrC '99 Proceedings of the 7th International Workshop on New Directions in Rough Sets, Data Mining, and Granular-Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We provide the unified methodology for searching for approximate decision reducts based on rough membership distributions. Presented study generalizes well known relationships between rough set reducts and boolean prime implicants.