This Article 
 Bibliographic References 
 Add to: 
Constructing the Dependency Structure of a Multiagent Probabilistic Network
May/June 2001 (vol. 13 no. 3)
pp. 395-415

Abstract—A probabilistic network consists of a dependency structure and corresponding probability tables. The dependency structure is a graphical representation of the conditional independencies that are known to hold in the problem domain. In this paper, we propose an automated process for constructing the combined dependency structure of a multiagent probabilistic network. Each domain expert supplies any known conditional independency information and not necessarily an explicit dependency structure. Our method determines a succinct representation of all the supplied independency information called a minimal cover. This process involves detecting all inconsistent information and removing all redundant information. A unique dependency structure of the multiagent probabilistic network can be constructed directly from this minimal cover. The main result of this paper is that the constructed dependency structure is a perfect-map of the minimal cover. That is, every probabilistic conditional independency logically implied by the minimal cover can be inferred from the dependency structure and every probabilistic conditional independency inferred from the dependency structure is logically implied by the minimal cover.

[1] S. Abiteboul, R. Hull, and V. Vianu, Foundations of Databases. Addison-Wesley, 1995.
[2] C. Beeri, R. Fagin, and J. Howard, “A Complete Axiomatization for Functional and Multivalued Dependencies in Database Relations,” Proc. ACM SIGMOD, pp. 47-61, 1977.
[3] C. Beeri, “On the Membership Problem for Functional and Multivalued Dependencies in Relational Databases,” ACM Trans. Database Systems, vol. 5, no. 3, pp. 241-259, 1980.
[4] C. Beeri, R. Fagin, D. Maier, and M. Yannakakis, “On the Desirability of Acyclic Database Schemes,” J. ACM, vol. 30, pp. 479-513, 1983.
[5] U. Bertele and F. Brioschi, "Nonserial dynamic programming," Mathematics in Science and Engineering series, vol. 91, Academic Press, 1972.
[6] C.J. Butz and S.K.M. Wong, “Recovery Protocols in Multi-Agent Probabilistic Reasoning Systems,” Proc. Int'l Database Eng. and Applications Symp., pp. 302-310, 1999.
[7] R. Dechter, A. Dechter, and J. Pearl, “Optimization in Constraint Networks,” Influence Diagrams, Belief Nets, and Decision Analysis, R.M. Oliver and J.Q. Smith, eds., pp. 411-425, Wiley, 1990.
[8] R. Fagin, "Multivalued Dependencies and a New Normal Form for Relational Databases," ACM Trans. Database Systems, vol. 2, no. 3, pp. 262-278, Sept. 1977.
[9] Z. Galil, “An Almost Linear-Time Algorithm for Computing a Dependency Basis in a Relational Database,” J. ACM, vol. 29, no. 1, pp. 96-102, 1982.
[10] D. Geiger and J. Pearl, “Logical and Algorithmic Properties of Conditional Independence,” Technical Report R-97-II-L, Univ. of California, Los Angeles, 1989.
[11] P. Hajek, T. Havranek, and R. Jirousek, Uncertain Information Processing in Expert Systems. CRC Press, 1992.
[12] J. Hu and Y. Xiang, “Learning Belief Networks in Domains with Recursively Embedded Pseudo Independent Submodels,” Proc. 13th Conf. Uncertainty in Artificial Intelligence, pp. 258-265, 1997.
[13] F. Jensen, “Junction Tree and Decomposable Hypergraphs,” technical report, JUDEX, Aalborg, Denmark, 1988.
[14] F. Jensen, An Introduction to Bayesian Neworks. Springer Verlag, 1996.
[15] S.L. Lauritzen and D.J. Spiegelhalter, “Local Computation with Probabilities on Graphical Structures and Their Application to Expert Systems,” J. Royal Statistical Soc. B, vol. 50, pp. 157-244, 1988.
[16] Y.E. Lien, “Hierarchical Schemata for Relational Databases,” ACM Trans. Database Systems, vol. 6, no. 1, pp. 48-69, 1981.
[17] Y.E. Lien,“On the equivalence of database models,” J. ACM, vol. 2, pp. 333-362, 1982.
[18] D. Maier, The Theory of Relational Databases. Computer Science Press, 1983.
[19] R. Neapolitan, Probabilistic Reasoning in Expert Systems: Theory and Algorithms, John Wiley&Sons, New York, 1990.
[20] J. Pearl, Probabilistic Reasoning in Intelligent Systems. San Mateo, Calif.: Morgan Kaufman, 1988.
[21] D.J. Rose, “Triangulated Graphs and the Elimination Process,” J. Math. Analysis Applications, vol. 32, pp. 597-609, 1970.
[22] Y. Sagiv, “An Algorithm for Inferring Multivalued Dependencies with an Application to Propositional Logic,” J. ACM, vol. 27, no. 2, pp. 250-262, 1980.
[23] E. Sciore, “Some Observations on Real-World Data Dependencies,” Proc. XP1 Workshop, 1980.
[24] G. Shafer, “An Axiomatic Study of Computation in Hypertrees,” School of Business Working Papers 232, Univ. of Kansas, Lawrence, 1991.
[25] M. Studeny, “Conditional Independence Relations Have No Finite Complete Characterization,” Proc. 11th Prague Conf. Information Theory, Statistical Decision Foundation, and Random Processes, pp. 377-396, 1990.
[26] T. Verma and J. Pearl, "Equivalence and Synthesis of Causal Models," Proc. Sixth Conf. Uncertainty in Artificial Intelligence,Boston, Mass., pp. 220-227, 1990.
[27] S.K.M. Wong, “Testing Implication of Probabilistic Dependencies,” Proc. 12th Conf. Uncertainty in Artificial Intelligence, pp. 545-553, 1996.
[28] S.K.M. Wong, “An Extended Relational Data Model for Probabilistic Reasoning,” J. Intelligent Information Systems, vol. 9, pp. 181-202, 1997.
[29] S.K.M. Wong, “The Relational Structure of Belief Networks,” J. Intelligent Information Systems, 1998.
[30] S.K.M. Wong, “A Rule-Based Language for Probabilistic Reasoning,” Information, Uncertainty, and Fusion, B. Bouchon-Meunier, R. Yager, and L. Zadeh, eds., pp. 221-232, Kluwer, 2000.
[31] S.K.M. Wong and Y. Xiang, “Construction of a Markov Network from Data for Probabilistic Inference,” Proc. Third Int'l Conf. Rough Sets and Soft Computing, pp. 562-569, 1994.
[32] S.K.M. Wong and Z. Wang, ”On Axiomatization of Probabilistic Conditional Independence,” Proc. 10th Conf. Uncertainty in Artificial Intelligence, pp. 591-597, 1994.
[33] S.K.M. Wong and C.J. Butz, “Probabilistic Reasoning in a Distributed Multi-Agent Environment,” Proc. Third Int'l Conf. Multi-Agent Systems, pp. 341-348, 1998.
[34] S.K.M. Wong and C.J. Butz, “Contextual Weak Independence in Bayesian Networks,” Proc. 15th Conf. Uncertainty in Artificial Intelligence, pp. 670-679, 1999.
[35] S.K.M. Wong, C.J. Butz, and Y. Xiang, “A Method for Implementing a Probabilistic Model as a Relational Database,” Proc. 11th Conf. Uncertainty in Artificial Intelligence, pp. 556-564, 1995.
[36] S.K.M. Wong, C.J. Butz, and Y. Xiang, “Automated Database Scheme Design Using Mined Data Dependencies,” J. Am. Soc. Information Science, vol. 49, no. 5, pp. 455-470, 1998.
[37] Y. Xiang, “Verification of DAG Structures in Cooperative Belief Network-Based Multi-agent Systems,” Networks, vol. 31, pp. 183-191, 1998.
[38] Y. Xiang, D. Poole, and M.P. Beddoes, “Multiply Sectioned Bayesian Networks and Junction Forests for Large Knowledge-Based Systems,” Computational Intelligence, vol. 9, pp. 171-220, 1993.

Index Terms:
Probabilistic networks, dependency structure, probabilistic reasoning, conditional independence, data dependencies, multiagent systems.
S.K. Michael Wong, Cory J. Butz, "Constructing the Dependency Structure of a Multiagent Probabilistic Network," IEEE Transactions on Knowledge and Data Engineering, vol. 13, no. 3, pp. 395-415, May-June 2001, doi:10.1109/69.929898
Usage of this product signifies your acceptance of the Terms of Use.