Abstract
Some probabilistic properties of decision algorithms composed of “if..., then...” decision rules are considered. With every decision rule three probabilities are associated: the strength, the certainty and the coverage factors of the rule. It has been shown previously that the certainty and the coverage factors are linked by Bayes’ theorem. Bayes’ theorem has also been presented in a simple form employing the strength of decision rules. In this paper, we relax some conditions on the decision algorithm, in particular, a condition on mutual exclusion of decision rules, and show that the former properties still hold. We also show how the total probability theorem is related with modus ponens and modus tollens inference rules when decision rules are true in some degree of the certainty factor. Moreover, we show that under the relaxed condition, with every decision algorithm a flow graph can be associated, giving a useful interpretation of decision algorithms.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Berthold, M., Hand, D. J.: Intelligent data analysis, an introduction. Springer-Verlag, Berlin, Heidelberg, New York (1999)
Pawlak, Z.: Rough Sets-Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Boston Dordrecht, London (1991)
Pawlak, Z.: Rough sets, decision algorithm and Bayes’ theorem. European Journal of Operational Research 136 (2002a) pp. 181–189
Pawlak, Z.: Bayes’ Theorem-the Rough Sets Perspective. Working paper, Warsaw (2002b)
Pawlak, Z.: Decision Algorithms, Bayes’ Theorem and Flow Graph. Working paper, Warsaw (2002c)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Greco, S., Pawlak, Z., Słowiński, R. (2002). Generalized Decision Algorithms, Rough Inference Rules, and Flow Graphs. In: Alpigini, J.J., Peters, J.F., Skowron, A., Zhong, N. (eds) Rough Sets and Current Trends in Computing. RSCTC 2002. Lecture Notes in Computer Science(), vol 2475. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45813-1_12
Download citation
DOI: https://doi.org/10.1007/3-540-45813-1_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44274-5
Online ISBN: 978-3-540-45813-5
eBook Packages: Springer Book Archive