Vibhav GogateIterative Join Graph PropagationPapers
Software: Download the binaries HelpCaution! IJGP is run as an anytime scheme. Therefore, it may eat your linux swap space, if the problem is hard. To set proper time and memory limits use the ulimit command. For example, use: “ulimit -v 2097152” to limit the amount of memory available to 2 Gigabytes. To run the solver with default options, just type: ijgp [options] < uai08file > < uai08evidfile > The uai08file and the uai08evidfile should be in UAI 2008 format. The description of this format is available here. The output will be stored in < uai08file > .MAR in the working directory. Note that after each i-bound, the results are written to the output file. [http:www.cs.huji.ac.ilprojectUAI10/fileFormat.php How to set the options:
Exampleijgp –order min-degree –i-bound 3 –num-iterations 100 BN_69.uai BN_69.uai.evid This will run ijgp on the specified files. The join-graphs will be constructed using the min-degree ordering. The starting i-bound is 3. Note that IJGP is run as an anytime scheme. In this case, we will start with an i-bound of 3, run IJGP until convergence or 100 iterations whichever is earlier. Then we increase the i-bound by one and reconstruct the join graph, iteratively repeating the process until we run out of memory or time. |