Abstract
Several researchers have suggestedthat Bayesian networks (BNs) shouldb e usedto manage the inherent uncertainty in information retrieval. However, it has been arguedthat manually constructing a large BN is a difficult process. In this paper, we obtain the only minimal complete subset of the semi-graphoidaxiomatization governing the independency information in a BN. This result may be useful in developing an automatedBN construction procedure for information retrieval purposes.
This is a preview of subscription content, log in via an institution to check access.
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
Beeri, C., Fagin, R., and Howard, J.H.: A complete axiomatization for functional and multivalued dependencies in database relations. Proc. of ACM-SIGMOD International Conference on Management of Data (1977) 47–61
Dawid, A.P.: Conditional independence in statistical theory. Journal of the Royal Statistical Society 41B (1979) 1–31
Koller, D. and Pfeffer, A. Object-orientedba yesian networks. Proc. of the Thirteenth Conference on Uncertainty in Artificial Intelligence (1997) 302–313
Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann Publishers, San Francisco (1988)
Silva, I., Ribeiro-Neto, B., Calado, P., Moura, E., and Ziviani, N.: Link-based andcon tent-basedevid ential information in a belief network model. Proc. of the Twenty-third Annual ACM SIGIR Conference on Research and Development in Information Retrieval (2000) 96–103
Studeny, M.: Multiinformation and the problem of characterization of conditional-independence relations. Problems of Control and Information Theory 18(1) (1989) 3–16
Studeny, M.: Conditional independence relations have no finite complete characterization. Proc. of the Eleventh Prague Conference on Information Theory, Statistical Decision Foundation and Random Processes (1990) 377–396
Verma, T. and Pearl, J.: An algorithm for deciding if a set of observed independencies has a causal explanation. Proc. of the Eighth Conference on Uncertainty in Artificial Intelligence (1992) 323–330
Wong, S.K.M., Butz, C.J., and Wu, D.: On the implication problem for probabilistic conditional independency. IEEE Trans. Syst. Man Cybern. SMC-A 30(6) (2000) 785–805
Wong, S.K.M. and Butz, C.J.: Constructing the dependency structure of a multiagent probabilistic network. IEEE Trans. Knowl. Data Eng. 13(3) (2001) (to appear)
Wong, S.K.M. and Wang, Z.W.: On axiomatization of probabilistic conditional independence. Proc. of the Tenth Conference on Uncertainty in Artificial Intelligence (1994) 591–597
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Butz, C.J. (2001). On Axiomatizing Probabilistic Conditional Independencies in Bayesian Networks. In: Zhong, N., Yao, Y., Liu, J., Ohsuga, S. (eds) Web Intelligence: Research and Development. WI 2001. Lecture Notes in Computer Science(), vol 2198. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45490-X_14
Download citation
DOI: https://doi.org/10.1007/3-540-45490-X_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42730-8
Online ISBN: 978-3-540-45490-8
eBook Packages: Springer Book Archive