Name
Abstract | ||
|---|---|---|
Multiply sectioned Bayesian networks (MSBNs) support multiagent probabilistic inference in distributed large problem domains. Inference in MSBNs can be performed effectively using their compiled representations. The compilation involves cooperative moralization and triangulation of the set of local graphical structures that collectively defines the dependencies among domain variables. Privacy of agents prevents us from compiling MSBNs by first assembling graphical subnets at a central location and then compiling their union. In earlier work, agents perform compilation in a limited parallel via a depth-first traversal of the local structures organized in a tree structure (called hypertree). Agents need some synchronization with each other. In this paper, we present an iterative method, by which multiple agents compile MSBNs asynchronously. Compared to the traversal method, the iterative one is self-adaptive and robust. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1109/IAT.2006.82 | IAT |
Keywords | Field | DocType |
bayesian network,multi agent systems,bioinformatics,iteration method,tree structure,distributed systems,scalability | Data mining,Tree traversal,Hyperbolic tree,Iterative method,Computer science,Inference,Theoretical computer science,Multi-agent system,Bayesian network,Tree structure,Graphical model | Conference |
ISBN | Citations | PageRank |
0-7695-2748-5 | 0 | 0.34 |
References | Authors | |
10 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xiangdong An | 1 | 64 | 13.56 |
| Nick Cercone | 2 | 1999 | 570.62 |