untitled

(ff) #1
14.3 Constructing Bayesian Networks 347


  1. Classes can inherit from other classes which allows for still more possibil-
    ities for reuse.

  2. Encapsulation can be used during inference to improve performance. This
    advantage is especially compelling. As shown in (Koller and Pfeffer 1997),
    if a BN has an OOBN structure, then the performance of inferencing can
    be improved by an order of magnitude or more compared with even a
    well-optimized BN inference algorithm.


Another feature of the OOBN methodology is the notion of anobject-oriented
network fragment(OONF). An OONF is a generalization of a BN which spec-
ifies the conditional distribution of a set of value attributes given some set
of input attributes. If there are no input attributes, then an OONF is a BN.
An OONF can be defined recursively in terms of other OONFs. An OONF
can also be used as acomponentwhich can be “reused” multiple times in a
single BN. Component-based methods are powerful development method-
ologies that allow one to build BNs from standard components that have
been constructed independently.

Summary

The OOBN methodology introduces several notions to BN development:


  • Components which can be used more than once

  • Groupings of BN nodes with a formally defined interface

  • Inference algorithms that take advantage of the OOBN structure to im-
    prove performance significantly


14.3.4 Ontologies as BNs


One of the earliest large BNs was the QMR-DT mentioned in section 14.1
which added probabilities to an expert system. The close connection between
expert systems and ontologies would suggest that it ought to be possible to
“add probabilities” to ontologies. Perhaps because of this analogy, an active
research area has developed that is attempting to do this for ontologies, es-
pecially for ontologies based on description logic. See (Ding and Peng 2004;
Koller et al. 1997).
Given an OWL-DL ontology, the corresponding BN has one node for each
class. This node is a Boolean random variable which is true precisely when
Free download pdf