|
||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
ObjectRC
RCDtree
public final class RCDtree
This class represents "compiled" dtree objects used in recursive conditioning.
Nested Class Summary |
---|
Nested classes/interfaces inherited from class RC |
---|
RC.RCCounters, RC.RCCreationException, RC.RCCreationParams, RC.RCStats, RC.RCStats_All, RC.RCStats_Pe, RC.RecCondThreadListener |
Field Summary |
---|
Constructor Summary | |
---|---|
RCDtree(RC.RCCreationParams params)
Warning: Using this constructor will not create the complete structure. |
|
RCDtree(RC.RCCreationParams params,
CachingScheme cs,
CachingScheme.RCCreateListener listnr,
DecompositionStructureUtils.ParamsTree crm_par)
Creates a new RCDtree based on the parameters. |
Method Summary | |
---|---|
static Thread |
allocateRCDtreeInThread(RCDtree dt,
CachingScheme cs,
CachingScheme.RCCreateListener listnr,
double seed_bestCost,
Map seed_cf)
|
static Thread |
createRCDtreeInThread(RC.RCCreationParams params,
CachingScheme cs,
CachingScheme.RCCreateListener listnr,
DecompositionStructureUtils.ParamsTree crm_par)
This will create a thread in which an RCDtree will be created (by using the listnr parameter, the search for CacheSchemes can be monitored and stopped which will return the best result found so far (if the cachingScheme supports it). |
RCNode |
getAnyRoot()
|
RCIterator |
getIteratorRoots()
|
RCIteratorTraversal |
getIteratorTraversal()
|
RCIterator |
getIteratorTree()
|
static String |
getStaticTagName()
|
String |
getTagName()
|
double[] |
recCond_All()
Run Recursive conditioning P(e) for each root node (special for testing & output of timing/memory...). |
void |
recCond_PreCompute()
Run RC for each root node to "precompute" the marginals. |
void |
setRoot(RCNode rt,
boolean callInit)
|
Methods inherited from class Object |
---|
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
---|
public RCDtree(RC.RCCreationParams params)
public RCDtree(RC.RCCreationParams params, CachingScheme cs, CachingScheme.RCCreateListener listnr, DecompositionStructureUtils.ParamsTree crm_par)
bn
- A valid BeliefNetwork to use.cs
- A valid CachingScheme to use.listnr
- A Listener or else null.scalar
- Usually 1.0, but for genetics can scale it (slowing down computations).useKB
- Uses UnitResolution in a KnowledgeBase during computations.includeMPE
- If true, allows MPE calculations to be run on this dtree, otherwise they cannot.
RCCreationException
- if could not create a RCDtree.Method Detail |
---|
public void setRoot(RCNode rt, boolean callInit)
public static Thread allocateRCDtreeInThread(RCDtree dt, CachingScheme cs, CachingScheme.RCCreateListener listnr, double seed_bestCost, Map seed_cf)
public static Thread createRCDtreeInThread(RC.RCCreationParams params, CachingScheme cs, CachingScheme.RCCreateListener listnr, DecompositionStructureUtils.ParamsTree crm_par)
It catches RCCreationException and will call rcCreateError() ------rcCreateDone(null) if that happens.
public RCIterator getIteratorRoots()
getIteratorRoots
in class RC
public RCIterator getIteratorTree()
getIteratorTree
in class RC
public RCIteratorTraversal getIteratorTraversal()
getIteratorTraversal
in class RC
public RCNode getAnyRoot()
getAnyRoot
in class RC
public void recCond_PreCompute()
RC
This is meant mostly for dgraphs, where the marginal is saved in the root. For a dtree, it will just fill up the caches, but not at the root node.
Note: It is possible for the returned value to be NaN if the network contains that in a cpt.
recCond_PreCompute
in class RC
public double[] recCond_All()
RC
Note: It is possible for the returned value to be NaN if the network contains that in a cpt.
recCond_All
in class RC
public String getTagName()
getTagName
in class RC
public static String getStaticTagName()
|
||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |