Abstract
Pawlak recently introduced rough set flow graphs (RSFGs) as a graphical framework for reasoning from data. Each rule is associated with three coefficients, which have been shown to satisfy Bayes’ theorem. Thereby, RSFGs provide a new perspective on Bayesian inference methodology.
In this paper, we show that inference in RSFGs takes polynomial time with respect to the largest domain of the variables in the decision tables. Thereby, RSFGs provide an efficient tool for uncertainty management. On the other hand, our analysis also indicates that a RSFG is a special case of conventional Bayesian network and that RSFGs make implicit assumptions regarding the problem domain.
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
Cooper, G.F.: The Computational Complexity of Probabilistic Inference Using Bayesian Belief Networks. Artificial Intelligence 42(2-3), 393–405 (1990)
Dawid, A.P., Lauritzen, S.L.: Hyper Markov Laws in The Statistical Analysis of Decomposable Graphical Models. The Annals of Satistics 21, 1272–1317 (1993)
Greco, S., Pawlak, Z., Slowinski, R.: Generalized Decision Algorithms, Rough Inference Rules and Flow Graphs. In: The Third International Conference on Rough Sets, and Current Trends in Computing, pp. 93–104 (2002)
Horvitz, E., Barry, E.M.: Display of Information for Time Critical Decision Making. In: Proceedings of Eleventh Conference on Uncertainty in Artificial Intelligence, pp. 296–305. Morgan Kaufmann, San Francisco (1995)
Horvitz, E., Breese, J., Heckerman, D., Hovel, D., Rommelse, K.: The Lumiere Project: Bayesian User Modeling for Inferring the Goals and Needs of Software Users. In: Proceedings of the Fourteenth Conference on Uncertainty in Artificial Intelligence, Madison, WI, pp. 256–265 (1998)
Pawlak, Z.: Flow Graphs and Decision Algorithms. In: The Ninth International Conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing, pp. 1–10 (2003)
Pawlak, Z.: In Pursuit of Patterns in Data Reasoning from Data - The Rough Set Way. In: The Third International Conference on Rough Sets, and Current Trends in Computing, pp. 1–9 (2002)
Pawlak, Z.: Rough Sets. International Journal of Computer and Information Sciences 11(5), 341–356 (1982)
Pawlak, Z.: Rough Sets: Theoretical Aspects of Reasoning about Data. Kluwer Academic, Dordrecht (1991)
Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, San Francisco (1988)
Pearl, J.: Reverend Bayes on Inference Engines: A Distributed Heirarchical Approach, pp. 133–136. AAAI, Menlo Park (1982)
Shafer, G.: Probabilistic Expert Systems. Society for the Institute and Applied Mathematics, Philadelphia (1996)
Wong, S.K.M., Butz, C.J., Wu, D.: On the Implication Problem for Probabilistic Conditional Independency. IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans 30(6), 785–805 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Butz, C.J., Yan, W., Yang, B. (2005). The Computational Complexity of Inference Using Rough Set Flow Graphs. In: Ślęzak, D., Wang, G., Szczuka, M., Düntsch, I., Yao, Y. (eds) Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing. RSFDGrC 2005. Lecture Notes in Computer Science(), vol 3641. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11548669_35
Download citation
DOI: https://doi.org/10.1007/11548669_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28653-0
Online ISBN: 978-3-540-31825-5
eBook Packages: Computer ScienceComputer Science (R0)