il2.inf.structure
Class EliminationOrders

Object
  extended by EliminationOrders

public class EliminationOrders
extends Object


Nested Class Summary
static class EliminationOrders.JT
           
static class EliminationOrders.Record
           
 
Constructor Summary
EliminationOrders()
           
 
Method Summary
static EliminationOrders.Record boundedConstrainedMinFill(Collection subDomains, IntSet postponeSet, double weightBound)
           
static EliminationOrders.JT bucketerJoinTree(Collection subdomains, IntList order)
          This method is an alternative to traditionalJoinTree.
static Graph compatibilityGraph(Collection potentials)
           
static double computeSize(Collection subDomains, IntList order)
           
static EliminationOrders.Record constrainedMinFill(Collection subDomains, IntSet eliminateLast)
           
static EliminationOrders.Record constrainedMinSize(Collection subDomains, IntSet eliminateLast)
           
static EliminationOrders.Record createRecord(Collection subDomains, IntList order)
           
static EliminationOrders.Record hardBoundedConstrainedFill(Collection subDomains, IntSet postponeSet, double weightBound)
           
static double largestCptClique(Collection subDomains)
           
static EliminationOrders.Record minFill(Collection subDomains, int reps, Random seed)
           
static EliminationOrders.Record minfill2(Collection subDomains, IntSet[] vars, int reps, Random seed)
          Replacing JD's original minfill with a much faster version.
static EliminationOrders.Record minSize(Collection subDomains)
           
static EliminationOrders.Record oldConstrainedMinFill(Collection subDomains, IntSet eliminateLast)
          The old version of minfill which should not be used any more unless there is a very good reason.
static EliminationOrders.Record oldMinFill(Collection subDomains)
          The old version of minfill which should not be used any more unless there is a very good reason.
static int[] safePrefix(Collection subDomains)
           
static EliminationOrders.JT traditionalJoinTree(BayesianNetwork bn2, Converter c, IntList order)
           
static EliminationOrders.JT traditionalJoinTree(Collection subdomains)
          This method is safe to use only in the absence of a BayesianNetwork object.
static EliminationOrders.JT traditionalJoinTree(Collection subdomains, IntList order)
          This method is safe to use only in the absence of a BayesianNetwork object.
static EliminationOrders.JT traditionalJoinTree(Collection subdomains, IntList order, Converter c, BayesianNetwork bn2)
          This method produces a jointree using max-spanning tree on a clique graph.
 
Methods inherited from class Object
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
 

Constructor Detail

EliminationOrders

public EliminationOrders()
Method Detail

computeSize

public static double computeSize(Collection subDomains,
                                 IntList order)

createRecord

public static EliminationOrders.Record createRecord(Collection subDomains,
                                                    IntList order)

minSize

public static EliminationOrders.Record minSize(Collection subDomains)

oldMinFill

public static EliminationOrders.Record oldMinFill(Collection subDomains)
The old version of minfill which should not be used any more unless there is a very good reason.


minFill

public static EliminationOrders.Record minFill(Collection subDomains,
                                               int reps,
                                               Random seed)

minfill2

public static EliminationOrders.Record minfill2(Collection subDomains,
                                                IntSet[] vars,
                                                int reps,
                                                Random seed)
Replacing JD's original minfill with a much faster version.


constrainedMinFill

public static EliminationOrders.Record constrainedMinFill(Collection subDomains,
                                                          IntSet eliminateLast)

oldConstrainedMinFill

public static EliminationOrders.Record oldConstrainedMinFill(Collection subDomains,
                                                             IntSet eliminateLast)
The old version of minfill which should not be used any more unless there is a very good reason.


constrainedMinSize

public static EliminationOrders.Record constrainedMinSize(Collection subDomains,
                                                          IntSet eliminateLast)

boundedConstrainedMinFill

public static EliminationOrders.Record boundedConstrainedMinFill(Collection subDomains,
                                                                 IntSet postponeSet,
                                                                 double weightBound)

hardBoundedConstrainedFill

public static EliminationOrders.Record hardBoundedConstrainedFill(Collection subDomains,
                                                                  IntSet postponeSet,
                                                                  double weightBound)

compatibilityGraph

public static Graph compatibilityGraph(Collection potentials)

traditionalJoinTree

public static EliminationOrders.JT traditionalJoinTree(Collection subdomains)
This method is safe to use only in the absence of a BayesianNetwork object.

Since:
021004

traditionalJoinTree

public static EliminationOrders.JT traditionalJoinTree(Collection subdomains,
                                                       IntList order)
This method is safe to use only in the absence of a BayesianNetwork object.

Since:
160105

traditionalJoinTree

public static EliminationOrders.JT traditionalJoinTree(Collection subdomains,
                                                       IntList order,
                                                       Converter c,
                                                       BayesianNetwork bn2)
This method produces a jointree using max-spanning tree on a clique graph. Therefore this approach to constructing a jointree is at least quadratic space and time (in the number of clusters). Not suitable for large Bayesian networks (with thousands of nodes).


traditionalJoinTree

public static EliminationOrders.JT traditionalJoinTree(BayesianNetwork bn2,
                                                       Converter c,
                                                       IntList order)
Since:
012904

largestCptClique

public static double largestCptClique(Collection subDomains)

safePrefix

public static int[] safePrefix(Collection subDomains)

bucketerJoinTree

public static EliminationOrders.JT bucketerJoinTree(Collection subdomains,
                                                    IntList order)
This method is an alternative to traditionalJoinTree. It induces a jointree from a trace of bucket elimination (variable elimination). The space consumed is only linear.



Copyright 2010 UCLA Automated Reasoning Group