|
||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
ObjectEliminationOrders
public class EliminationOrders
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 |
---|
public EliminationOrders()
Method Detail |
---|
public static double computeSize(Collection subDomains, IntList order)
public static EliminationOrders.Record createRecord(Collection subDomains, IntList order)
public static EliminationOrders.Record minSize(Collection subDomains)
public static EliminationOrders.Record oldMinFill(Collection subDomains)
public static EliminationOrders.Record minFill(Collection subDomains, int reps, Random seed)
public static EliminationOrders.Record minfill2(Collection subDomains, IntSet[] vars, int reps, Random seed)
public static EliminationOrders.Record constrainedMinFill(Collection subDomains, IntSet eliminateLast)
public static EliminationOrders.Record oldConstrainedMinFill(Collection subDomains, IntSet eliminateLast)
public static EliminationOrders.Record constrainedMinSize(Collection subDomains, IntSet eliminateLast)
public static EliminationOrders.Record boundedConstrainedMinFill(Collection subDomains, IntSet postponeSet, double weightBound)
public static EliminationOrders.Record hardBoundedConstrainedFill(Collection subDomains, IntSet postponeSet, double weightBound)
public static Graph compatibilityGraph(Collection potentials)
public static EliminationOrders.JT traditionalJoinTree(Collection subdomains)
public static EliminationOrders.JT traditionalJoinTree(Collection subdomains, IntList order)
public static EliminationOrders.JT traditionalJoinTree(Collection subdomains, IntList order, Converter c, BayesianNetwork bn2)
public static EliminationOrders.JT traditionalJoinTree(BayesianNetwork bn2, Converter c, IntList order)
public static double largestCptClique(Collection subDomains)
public static int[] safePrefix(Collection subDomains)
public static EliminationOrders.JT bucketerJoinTree(Collection subdomains, IntList order)
|
||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |