Justifying multiply sectioned Bayesian networks

@article{Xiang2000JustifyingMS,
  title={Justifying multiply sectioned Bayesian networks},
  author={Yang Xiang and Victor R. Lesser},
  journal={Proceedings Fourth International Conference on MultiAgent Systems},
  year={2000},
  pages={349-356}
}
  • Y. Xiang, V. Lesser
  • Published 10 July 2000
  • Computer Science
  • Proceedings Fourth International Conference on MultiAgent Systems
We consider multiple agents whose task is to determine the true state of an uncertain domain so they can act properly. If each agent only has partial knowledge about the domain and local observation, how can agents accomplish the task with the least amount of communication? Multiply sectioned Bayesian networks (MSBNs) provide an effective and exact framework for such a task but also impose a set of constraints. The most notable is the hypertree agent organization which prevents an agent from… 

Figures from this paper

Comparison of multiagent inference methods in multiply sectioned Bayesian networks
  • Y. Xiang
  • Computer Science
    Int. J. Approx. Reason.
  • 2003
Revising Markov boundary for multiagent probabilistic inference
  • X. An, Y. Xiang, N. Cercone
  • Computer Science
    Proceedings. IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 2004. (IAT 2004).
  • 2004
TLDR
An algorithm for cooperative computation of the observable Markov boundary of a set of nodes in an MSBN without revealing subnet structures is presented.
Interface Verification for Multiagent Probabilistic Inference
TLDR
This work presents a method that allows agents to verify cooperatively the d-sepset condition through message passing, and respects agent’s privacy, protects agent vendors’ know-how, and promotes integration of multiagent systems from independently developed agents.
Efficient Probabilistic Inference Algorithms for Cooperative Multiagent Systems
TLDR
This thesis presents a novel local adaptive importance sampler (LLAIS) designed to apply localized stochastic sampling while maintaining the LJF structure, and shows that effective multi-agent online monitoring with bounded error is possible in an MA-DBN through a new secondary inference structure and a factorized representation of forward messages.
1 Interface Verification for Multiagent Probabilistic Inference
TLDR
This work presents a method that allows agents to verify cooperatively the d-sepset condition through message passing, and respects agent’s privacy, protects agent vendors’ know-how, and promotes integration of multiagent systems from independently developed agents.
Agent Encapsulated Bayesian Networks|DRAFT I
TLDR
This research designs a cooperative multiagent system where the agents use locally designed Bayesian networks to represent their knowledge, and provides guidance for the design of probabilistic multiagent systems.
Some practical issues on implementing distributed multi-agent reasoning systems
TLDR
This paper proposes a practical method that gives the answer of how to achieve concrescence of agentspsila believes in a distributed multi-agent system, instead of restricting them by an assumption of being consistent.
Distributed Bayesian Networks in Highly Dynamic Agent Organizations
TLDR
It is argued that MSBN approach is not suitable for large and changing agent societies, and DPN approach facilitates selforganization of distributed systems and, consequently, can cope with variable agent societies.
Probabilistic reasoning in dynamic multiagent systems
TLDR
This paper presents an algorithm for cooperative computation of an observable Markov boundary of a set of nodes in MSBNs without revealing subnet structures and shows that it works well on simulated multiagent dynamic domains.
...
...

References

SHOWING 1-10 OF 21 REFERENCES
MULTIPLY SECTIONED BAYESIAN NETWORKS AND JUNCTION FORESTS FOR LARGE KNOWLEDGE‐BASED SYSTEMS
Bayesian networks provide a natural, concise knowledge representation method for building knowledge‐based systems under uncertainty. We consider domains representable by general but sparse networks
Object-Oriented Bayesian Networks
TLDR
This paper provides an inference algorithm for OOBNs, and shows that much of the structural information encoded by an OOBN--particularly the encapsulation of variables within an object and the reuse of model fragments in different contexts---can also be used to speed up the inference process.
Multiagent truth maintenance
TLDR
An algorithm for truth maintenance is provided that guarantees local consistency for each agent and global consistency for data shared by the agents and is shown to be complete, in the sense that if a consistent state exists, the algorithm will either find it or report failure.
Symbolic Probabilistic Inference in Belief Networks
The Symbolic Probabilistic Inference (SPI) Algorithm [D'Ambrosio, 1989] provides an efficient framework for resolving general queries on a belief network. It applies the concept of
Abstraction in Bayesian Belief Networks and Automatic Discovery from Past Inference Sessions
TLDR
An abstraction scheme is developed to simplify Bayesian belief network structures for future inference sessions and an approach for automatic discovery of good abstractions from the past inference sessions is presented.
DATMS: A Framework for Distributed Assumption Based Reasoning
Nested Junction Trees
TLDR
It is shown that by exploiting such nested junction trees in the computation of messages both space and time costs of the conventional propagation methods may be reduced.
Probabilistic reasoning in intelligent systems - networks of plausible inference
  • J. Pearl
  • Computer Science
    Morgan Kaufmann series in representation and reasoning
  • 1989
TLDR
The author provides a coherent explication of probability as a language for reasoning with partial belief and offers a unifying perspective on other AI approaches to uncertainty, such as the Dempster-Shafer formalism, truth maintenance systems, and nonmonotonic logic.
...
...