Constructing the dependency structure of a multiagent probabilistic network

Abstract

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.

A Web-Based Intelligent Tutoring System for Computer Programming

“…Obviously, this involves creating systems that can make decisions based on uncertain or incomplete information. One formal framework for uncertainty management is Bayesian networks [11,17,18], which utilize probability theory as a formal framework for uncertainty management in Artificial Intelligence. Web intelligence researchers have applied Bayesian networks to many tasks, including student monitoring [7,9], e-commerce [5,12], and multi-agents [8,15].…”

A query processing algorithm for hierarchical Markov networks

“…Since the hierarchical Markov network has many advantages over the Markov network representation [15], and given the explanation of the favorable experimental results at the end of Section 4, we feel that the hierarchical Markov network representation could eventually become the standard representation of Bayesian networks. Thus, the encouraging results reported in this paper are useful to any work applying BNs, including traditional information retrieval [2,7,10,16], web search [9], user profiling [11], multi-agents [5,12,17] and e-commerce [4].…”

“…To facilitate the inference process, a BN is typically transformed into a Markov network (MN) [12,13]. A MN is an acyclic hypergraph together with a marginal distribution for each hyperedge in the hypergraph.…”

“…Probability theory provides a formal foundation for uncertain reasoning [12]. In particular, Bayesian networks (BNs) [6] use the notion of probabilistic conditional independence [13] to facilitate the acquisition of a joint probability distribution.…”

“…In particular, Bayesian networks (BNs) [6] use the notion of probabilistic conditional independence [13] to facilitate the acquisition of a joint probability distribution. Several researchers have naturally suggested that Bayesian networks be applied in traditional information retrieval [2,7,10,16], web search [9], user profiling [11], multi-agents [5,12,17] and e-commerce [4].…”