Minimal Templates and Knowledge Discovery

Authors:
Barbara Marszał---Paszek;Piotr Paszek
Affiliations:
Institute of Computer Science, University of Silesia, Bedzińska 39, 41---200 Sosnowiec, Poland;Institute of Computer Science, University of Silesia, Bedzińska 39, 41---200 Sosnowiec, Poland
Venue:
RSEISP '07 Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms
Year:
2007

Citing 1
Cited 1

Rough Sets: Theoretical Aspects of Reasoning about Data

Rough Sets: Theoretical Aspects of Reasoning about Data

Comparison of some classification algorithms based on deterministic and nondeterministic decision rules

Transactions on rough sets XII

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper the dependences between the Dempster-Shafer theory and rough set theory have been used to find a minimal template in a given decision table. The Dempster-Shafer theory [5] is called a mathematical theory of evidence. This theory is based on belief functions and plausible reasoning is used to combine separate pieces of information (evidence) to calculate the probability of an event. Rough set theory was proposed by Pawlak in 1982 [3] as a mathematical tool for describing the uncertain knowledge. In 1987 [1] and 1991 [6] the basic functions of the evidence theory were defined, based on the notation from rough set theory. These definitions allow finding interesting dependences in decision tables.