Pre-processing for Triangulation of Probabilistic Networks

01/10/2013
by   Hans L. Bodlaender, et al.
0

The currently 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 forprobabilistic networks, that is, triangulations with a minimal maximum clique size. 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

page 5

page 6

page 8

research
05/10/2020

Randomized heuristic for the maximum clique problem

A clique in a graph is a set of vertices that are all directly connected...
research
11/17/2020

Optimizing Graph Processing and Preprocessing with Hardware Assisted Propagation Blocking

Extensive prior research has focused on alleviating the characteristic p...
research
08/12/2020

Boosting Data Reduction for the Maximum Weight Independent Set Problem Using Increasing Transformations

Given a vertex-weighted graph, the maximum weight independent set proble...
research
09/28/2017

Improved approximate near neighbor search without false negatives for l_2

We present a new algorithm for the c--approximate nearest neighbor searc...
research
05/20/2017

Combining tabu search and graph reduction to solve the maximum balanced biclique problem

The Maximum Balanced Biclique Problem is a well-known graph model with r...
research
11/21/2014

Pre-processing of Domain Ontology Graph Generation System in Punjabi

This paper describes pre-processing phase of ontology graph generation s...
research
11/22/2022

Kernelization of Discrete Optimization Problems on Parallel Architectures

There are existing standard solvers for tackling discrete optimization p...

Please sign up or login with your details

Forgot password? Click here to reset