Digitale Medien
Boston, USA and Oxford, UK
:
Blackwell Publishing, Inc.
Computational intelligence
21 (2005), S. 0
ISSN:
1467-8640
Quelle:
Blackwell Publishing Journal Backfiles 1879-2005
Thema:
Informatik
Notizen:
Currently, the most efficient algorithm for inference with a probabilistic network builds upon a triangulation of a network's graph. In this paper, we show that pre-processing can help in finding good triangulations for probabilistic networks, that is, triangulations with a maximum clique size as small as possible. We provide a set of rules for stepwise reducing a graph, without losing optimality. This reduction allows us to solve the triangulation problem on a smaller graph. From the smaller graph's triangulation, a triangulation of the original graph is obtained by reversing the reduction steps. Our experimental results show that the graphs of some well-known real-life probabilistic networks can be triangulated optimally just by preprocessing; for other networks, huge reductions in their graph's size are obtained.
Materialart:
Digitale Medien
URL:
http://dx.doi.org/10.1111/j.1467-8640.2005.00274.x
Permalink
| Bibliothek |
Standort |
Signatur |
Band/Heft/Jahr |
Verfügbarkeit |
